// Author: Klay Thompson
// Problem: H. Matrices and Sums
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 1010;

int n, a[maxn][maxn];

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n;
  if (n & 1) return cout << "No\n", 0;
  cout << "Yes\n";
  rep (i, 1, n / 2) {
    rep (j, 1, n - i + 1) a[i][j] = -1;
  }
  rep (i, n / 2 + 1, n) {
    rep (j, n - i + 2, n) a[i][j] = 1;
  }
  rep (i, 1, n) rep (j, 1, n) cout << a[i][j] << " \n"[j == n];
}