MathNet 2014 Question 4

Show that it is possible to write a $n \times n$ array of non-negative numbers (not necessarily distinct) such that the sums of entries on each row and each column are pairwise distinct perfect squares.