If a matrix satisfies the following conditions, we call it a silver matrix.
The matrix has dimensions n \times n.
All its elements belong to the set S = \{ 1, 2, 3, \ldots, 2n-1 \}.
For every integer (1 \leq i \leq n), all elements in the -th row and -th column form the set \{ 1, 2, 3, \ldots, 2n-1 \}.
For example, the following 4 \times 4 matrix is a silver matrix:
It has been proved that a silver matrix of size 2^K \times 2^K always exists. You are required to construct a silver matrix of size 2^K \times 2^K.
A single integer (1 \leq K \leq 9) is given.
Output a silver matrix of size 2^K \times 2^K. You should print 2^K lines, each containing 2^K integers.
Example 1