In a line 40 signs are written out: 20 crosses and 20 zeros. In one move, you can swap any two adjacent signs. What is the least number of moves in which it is guaranteed that you can ensure that some 20 consecutive signs are crosses?