KöMaL 2023 B5355

We colored $n$ squares red in a square lattice. We numbered the red squares from $1$ to $n$, and calculated the sum of the numbers for each pair of squares that share a common side. Is it true that for all arrangements of the $n$ squares it is possible to number the red squares in a way that we will get a different sum for all pairs that share a common side?