{"raw_statement":[{"iden":"problem statement","content":"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:\n\n*   Each square is painted in one of the $K$ colors.\n*   Each of the $K$ colors is used for some squares.\n*   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).\n\nGiven $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,"},{"iden":"constraints","content":"*   $1 \\leq K \\leq 1000$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$K$"},{"iden":"sample input 1","content":"2"},{"iden":"sample output 1","content":"3\n1 1 1\n1 1 1\n2 2 2\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\n2\n1 2\n2 2\n\n3\n1 1 1\n1 1 1\n1 1 1"},{"iden":"sample input 2","content":"9"},{"iden":"sample output 2","content":"3\n1 2 3\n4 5 6\n7 8 9"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}