Question 83
Let $N$ be a positive integer. In each square of a $N \times N$ array initially there is a zero. In each move it is allowed to choose a row or a column, erase all the numbers in it and then write numbers from $1$ to $N$ in arbitrary order. What is the maximal possible value of the sum of all numbers in the array?