Question 133
Is there a positive integer $n$ for which it is possible to write a number $-1$, $0$ or $1$ into each cell of an $n \times n$ table in such a way that every integer from $-n$ to $n$ occurs at least once among the row sums, column sums and the two sums of the numbers on one long diagonal? If yes then find the least such $n$.