Score : 1100 points
You are given an integer N.
Construct any one N-by-N matrix a that satisfies the conditions below. It can be proved that a solution always exists under the constraints of this problem.
Input is given from Standard Input in the following format:
N
Print your solution in the following format:
a_{1,1} ... a_{1,N} : a_{N,1} ... a_{N,N}
2
4 7 23 10