In the lower-left $3\times3$ square of an $8\times8$ chessboard there are nine pawns. Every pawn can jump horizontally or vertically over a neighboring pawn to the cell across it if that cell is free. Is it possible to arrange the nine pawns in the upperleft $3\times3$ square of the chessboard using finitely many such moves?