Place the integers \[1,2,3,...,{n^2}\] (without duplication) in any order onto an \[n \times n\] chessboard, with one integer per square. Show that there exist two (horizontally, vertically, or diagonally) adjacent squares whose values differ by at least n + 1.