Squares of an 8×8 chessboard are each allocated a number between 1 and 32 , with each number being used twice. Prove that it is possible to choose 32 such squares, each allocated a different number, so that there is at least one such square on each row or column . (A . Andjans, Riga combinatoricssquare table