#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  if (n == 1) {
    cout << "No\n";
    return 0;
  }
  vector<vector<int>> ans;
  if (n % 2 == 0) {
    ans = {
      {0, -1, 1, 0},
      {1, 0, 0, -1},
      {-1, 0, 0, 1},
      {0, 1, -1, 0}
    };
  } else {
    ans = {
      {0, 1, 1, 0, -2, 0, 0, 0},
      {-1, 0, 0, -1, 0, 2, 0, 0},
      {-1, 0, 0, -1, 0, 0, 2, 0},
      {0, 1, 1, 0, 0, 0, 0, -2},
      {2, 0, 0, 0, 0, -1, -1, 0},
      {0, -2, 0, 0, 1, 0, 0, 1},
      {0, 0, -2, 0, 1, 0, 0, 1},
      {0, 0, 0, 2, 0, -1, -1, 0}
    };
  }
  while (ans.size() < (1 << n)) {
    const int m = ans.size();
    vector nxt(m * 4, vector<int>(m * 4, 0));
    REP(i, 4) REP(y, m) REP(x, m) nxt[i * m + y][i * m + x] = ans[y][x];
    REP(y, m) {
      nxt[y][y + m] = 1;
      nxt[y + m][y] = -1;
    }
    REP(y, m) {
      nxt[y + m * 2][y + m * 3] = -1;
      nxt[y + m * 3][y + m * 2] = 1;
    }
    REP(y, m) {
      nxt[y][y + m * 2] = -1;
      nxt[y + m * 2][y] = 1;
    }
    REP(y, m) {
      nxt[y + m][y + m * 3] = 1;
      nxt[y + m * 3][y + m] = -1;
    }
    ans.swap(nxt);
  }
  cout << "Yes\n";
  REP(y, 1 << n) REP(x, 1 << n) cout << ans[y][x] << " \n"[x + 1 == (1 << n)];
  return 0;
}