A knight stands on a square of a standard 8×8 chessboard. In one move, it travels 2 squares along a row or a column, then 1 square perpendicular to that direction. Prove that any sequence of moves returning the knight to its starting square has an even number of moves.