IR-TST 2014 Problem 3

we named a $n*n$ table $selfish$ if we number the row and column with $0,1,2,3,...,n-1$ .(from left to right an from up to down) for every { $i,j\in{0,1,2,...,n-1}$ } the number of cell $(i,j)$ is equal to the number of number $i$ in the row $j$ . for example we have such table for $n=5$ 1 0 3 3 4 1 3 2 1 1 0 1 0 1 0 2 1 0 0 0 1 0 0 0 0 prove that for $n>5$ there is no $selfish$ table