#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1033;
int used[99], a[N][N], s[N][N];
LL fastpo(LL x, LL n, LL mod) {
    LL res = 1;
    while(n) {
        if(n & 1) res = res * x % mod;
        x = x * x % mod;
        n /= 2;
    }
    return res;
}
bool dfs(int v) {
    if(v == 16) {
        return true;
    }else {
        int x = v / 4;
        int y = v % 4;
        for(int i = 0; i < 16; i++) {
            if(!used[i]) {
                a[x][y] = i;

                if(x >= 1 && y >= 2 && a[x][y] + a[x - 1][y] != a[x][y - 2] + a[x - 1][y - 2]) continue;
                if(x >= 2 && y >= 1 && a[x][y] + a[x][y - 1] != a[x - 2][y] + a[x - 2][y - 1]) continue;
                used[i] = true;
                if(dfs(v + 1)) {
                    return true;
                }
                used[i] = false;
            }
        }
    }
    return false;
}
int main() {
    int n;
    scanf("%d", &n);
    if(n == 1) {
        printf("NO\n");
        exit(0);
    }
    dfs(0);
    for(int i = 3; i <= n; i++) {
        for(int x = (1 << (i - 1)) - 1; x >= 0; x--) {
            for(int y = (1 << (i - 1)) - 1; y >= 0; y--) {
                a[x * 2][y * 2] = a[x][y] * 4;
                a[x * 2][y * 2 + 1] = a[x][y] * 4 + 1;
                a[x * 2 + 1][y * 2] = a[x][y] * 4 + 2;
                a[x * 2 + 1][y * 2 + 1] = a[x][y] * 4 + 3;
            }
        }
    }
    printf("YES\n");
    for(int i = 0; i < (1 << n); i++) {
        for(int j = 0; j < (1 << n); j++) {
            printf("%d%c", a[i][j] + 1, j == (1 << n) - 1 ? '\n' : ' ');
        }
    }
    for(int i = 0; i < (1 << n); i++) {
        for(int j = 0; j < (1 << n); j++) {
            s[i + 1][j + 1] = s[i][j + 1] + s[i + 1][j] - s[i][j] + a[i][j];
        }
    }
    int l = (1 << n) / 2;
    LL eq = -1;
    for(int i = 0; i < l; i++) {
        for(int j = 0; j < l; j++) {
            LL val = s[i + l][j + l] - s[i][j + l] - s[i + l][j] + s[i][j];
            if(eq == -1) eq = val; else assert(eq == val);
        }
    }
}