Question 79
The numbers $1, 2, 3, \dots, (2n)^2$ are written in the unit squares of a $2n \times 2n$ array, $n \ge 3$. Prove that there exist $n+1$ columns in the array such that in each of them any number is less than the sum of the remaining $2n-1$ numbers in that column.