If a matrix satisfies the following conditions, we call it a silver matrix. \begin{enumerate} \item The dimensions of the matrix are \textbf{n}×\textbf{n}. \item All its elements belong to the set \textbf{S} = \{\textbf{1}, \textbf{2}, \textbf{3}, …, \textbf{2n-1}\}. \item For every integer \textbf{i} (\textbf{1} ≤ \textbf{i} ≤ \textbf{n}), all elements in the \textbf{i}-th row and \textbf{i}-th column make the set \{\textbf{1}, \textbf{2}, \textbf{3}, …, \textbf{2n-1}\}. \end{enumerate} For example, the following \textbf{4}×\textbf{4} matrix is a silver matrix: It is proved that silver matrix with size \textbf{2^K}×\textbf{2^K} always exists. And it is your job to find a silver matrix with size \textbf{2^K}×\textbf{2^K}. \InputFile The input contains only an integer \textbf{K} (\textbf{1} ≤ \textbf{K} ≤ \textbf{9}). \OutputFile You may output any matrix with size \textbf{2^K}×\textbf{2^K}. To output a \textbf{2^K}×\textbf{2^K} matrix, you should output \textbf{2^K} lines, and in each line output \textbf{2^K} integers.