output_description: Print your solution in the following format:
  
      
      
      a_{1,1} ... a_{1,N}
      :
      a_{N,1} ... a_{N,N}
      
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: n = int(input())
  MAX = 10**6
  mat = [[0] * n for i in range(n)]
  mat[0][0] = MAX
  for i in range(1, 2 * n):
      MAX -= 2
      for j in range(i + 1):
          try:
              mat[i - j][j] = MAX
          except:
              pass
  for i in mat:
      print(*i)
  
problem_description: Statement
  
  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.
  
    * 1 \leq a_{i,j} \leq 10^{15}
    * a_{i,j} are pairwise distinct integers.
    * There exists a positive integer m such that the following holds: Let x and y be two elements of the matrix that are vertically or horizontally adjacent. Then, {\rm max}(x,y) {\rm mod} {\rm min}(x,y) is always m.
samples: [{"input": "2", "output": "4 7\n    23 10\n    \n\n  * For any two elements x and y that are vertically or horizontally adjacent, {\\rm max}(x,y) {\\rm mod} {\\rm min}(x,y) is always 3."}]