#include <bits/stdc++.h>
using namespace std ;

#define ff    first
#define ss    second
#define pb    push_back

typedef long long    ll;
typedef pair<ll,ll>    ii;
typedef long double    lf;


mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll SQ = 320;
const ll N = 11;
const ll mod = 1e9 + 7;
const ll oo = 1e18;
long double eps = 1e-9;


int mat[(1<<N)][(1<<N)];

void build (int n) {
  if (n == 2) return;
  build(n-1);
  int b1 = 2 * n - 2, b2 = 2 * n-1;

  for (int i = 0; i < (1<<(n-1)); ++i){
    for (int j = 0; j < (1<<(n-1)); ++j) {
      mat[i + (1<<(n-1))][j] = mat[i][j + (1<<(n-1))] = mat[i + (1<<(n-1))][j + (1<<(n-1))] = mat[i][j];
    }
  }

  for (int i = 0; i < (1<<n); ++i) {
    for (int j = 0; j < (1<<n); ++j) {
//      int cuad = ((i >= (1<<(n-1))) + (j >= (1<<(n-1))));
      if ((i + j) % 2 == (i >= (1<<(n-1))) % 2) {
        mat[i][j] |= (1<<b1);
//        cout << "on " << b1 << ' ' <<i << ' '<<j << '\n';
      }
      if ((i + j) % 2 == (j >= (1<<(n-1)))) {
        mat[i][j] |= (1<<b2);
//        cout << "on " << b2 << ' ' << i << ' '<<j << '\n';
      }
    }
  }


}

int main(){
  #ifdef LOCAL
  freopen("input.txt","r",stdin);
  #endif // LOCAL
  ios_base::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);

  mat[0][0] = 13;
  mat[0][1] = 10;
  mat[0][2] = 5;
  mat[0][3] = 2;

  mat[1][0] = 0;
  mat[1][1] = 7;
  mat[1][2] = 8;
  mat[1][3] = 15;

  mat[2][0] = 11;
  mat[2][1] = 12;
  mat[2][2] = 3;
  mat[2][3] = 4;

  mat[3][0] = 6;
  mat[3][1] = 1;
  mat[3][2] = 14;
  mat[3][3] = 9;

  int n; cin >> n;
  if (n == 1) cout << "NO\n";
  else {
    cout << "YES\n";
    build(n);
    int curr = -1;
//    if (tot.size() < (1<<n)*(1<<n)) cout << "bad\n";
    for (int i = 0; i < (1<<n); ++i) {
      for (int j = 0; j < (1<<n); ++j) {
        cout << mat[i][j] + 1 << ' ';
      }
      cout << '\n';
    }
  }


  return 0;
}