Let Kn,n be the complete bipartite graph with two parts of equal size n. In this paper, it is shown that depending on whether n is even or odd, Kn,n or Kn,n−I , where I is a 1-factor of Kn,n , can be decomposed into cycles of distinct even lengths for any integer n≥2 with the exception of n=4 .