#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int n,a[1010][1010];
int main() {
	scanf("%d",&n);
	if (n%2==1) {
		puts("No");
		return 0;
	}
	for (int d=0;d<n;d+=2) {
		rep(j,d,n) a[d][j]=1;
		rep(j,d+1,n) a[d+1][j]=-1;
		rep(j,d+2,n) {
			if (j%2==0) a[j][d]=1;
			else a[j][d+1]=-1;
		}
	}
	puts("Yes");
	rep(i,0,n) {
		rep(j,0,n) printf("%d ",a[i][j]); puts("");
	}
}