IMO 1988 - Shortlisted problems Question 4

(CZS 1) An $n\times n$ chessboard $(n\ge2)$ is numbered by the numbers $1,2,\ldots,n^2$ (every number occurs once). Prove that there exist two neighboring (which share a common edge) squares such that their numbers differ by at least $n$.