output_description: Output should be in the following format:
  
      
      
      n
      c_{0,0} c_{0,1} ... c_{0,n-1}
      c_{1,0} c_{1,1} ... c_{1,n-1}
      :
      c_{n-1,0} c_{n-1,1} ... c_{n-1,n-1}
      
  
  n should represent the size of the grid, and 1 \leq n \leq 500 must hold.
  c_{r,c} should be an integer such that 1 \leq c_{r,c} \leq K and represent the
  color for the square (r, c).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      K
attempt: N = int(input())
  if N <= 500:
      A = []
      for i in range(N):
          a = []
          for j in range(N):
              a.append(i + 1)
          A.append(a)
      print(N)
      for i in range(N):
          ans = ""
          for j in range(N):
              ans += str(A[i][j]) + " "
          print(ans)
  else:
      A = []
      for i in range(34):
          a = []
          for j in range(68):
              a.append((i * 34 + j) // 2 + 1)
          A.append(a)
          A.append(a)
      print(68)
      for i in range(68):
          ans = ""
          for j in range(68):
              ans += str(A[i][j]) + " "
          print(ans)
  
problem_description: Statement
  
  For an n \times n grid, let (r, c) denote the square at the (r+1)-th row from
  the top and the (c+1)-th column from the left. A _good_ coloring of this grid
  using K colors is a coloring that satisfies the following:
  
    * Each square is painted in one of the K colors.
    * Each of the K colors is used for some squares.
    * Let us number the K colors 1, 2, ..., K. For any colors i and j (1 \leq i \leq K, 1 \leq j \leq K), every square in Color i has the same number of adjacent squares in Color j. Here, the squares adjacent to square (r, c) are ((r-1)\; mod\; n, c), ((r+1)\; mod\; n, c), (r, (c-1)\; mod\; n) and (r, (c+1)\; mod\; n) (if the same square appears multiple times among these four, the square is counted that number of times).
  
  Given K, choose **n between 1 and 500** (inclusive) freely and construct a
  good coloring of an n \times n grid using K colors. It can be proved that this
  is always possible under the constraints of this problem,
samples: [{"input": "2", "output": "3\n    1 1 1\n    1 1 1\n    2 2 2\n    \n\n  * Every square in Color 1 has three adjacent squares in Color 1 and one adjacent square in Color 2.\n  * Every square in Color 2 has two adjacent squares in Color 1 and two adjacent squares in Color 2.\n\nOutput such as the following will be judged incorrect:\n\n    \n    \n    2\n    1 2\n    2 2\n    \n    \n    \n    3\n    1 1 1\n    1 1 1\n    1 1 1\n    \n\n* * *"}, {"input": "9", "output": "3\n    1 2 3\n    4 5 6\n    7 8 9"}]