#include <bits/stdc++.h> using namespace std; int n, a[40][40]; void dfs(int x, int y, int size) { if (size == 1) { a[x][y] = 1, a[x+1][y] = 2; a[x][y+1] = 2; a[x+1][y+1] = 1; return ; } dfs(x, y, size-1); for (int i=1; i<=x+pow(2, size-1)-1; i++) { for (int j=1; j<=y+pow(2, size-1)-1; j++) { a[i+(int)pow(2, size-1)][j] = a[i][j]+pow(2, size-1); a[i][j+(int)pow(2, size-1)] = a[i][j]+pow(2, size-1); a[i+(int)pow(2, size-1)][j+(int)pow(2, size-1)] = a[i][j]; } } } signed main() { scanf("%d", &n); if (n == 0) { puts("1"); return 0; } dfs(1, 1, n); for (int i=1; i<=pow(2, n); i++) { for (int j=1; j<=pow(2, n); j++) { printf("%-4d", a[i][j]); } puts(""); } return 0; }