#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
#define all1(x) (x).begin() + 1, (x).end()

mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());


void solve() {
    int n; cin >> n;
    if(n & 1) {
        cout << "No" << endl;
        return;
    }
    cout << "Yes" << endl;
    V<V<int>> ans(n + 1, V<int>(n + 1));
    for(int i = 1;i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if(i + j <= n + 1) ans[i][j] = 1;
            else ans[i][j] = -1;
            if(i + j == n + 1) {
                if(i <= n / 2) ans[i][j] = 1;
                else ans[i][j] = 0;
            } else if(i == j){
                if(i <= n / 2) ans[i][j] = 1;
                else ans[i][j] = -1;
            }
        }
    }

    for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) cout << ans[i][j] << " \n"[j == n];
    
}


int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    // int t; cin >> t;
    solve();
}