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

const int maxn=4100;
int n;
int ans[maxn+50][maxn+50];
int a[maxn+50];
int b[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	
	if (n<=2){
		cout << "Yes" << "\n";
		for (int i=1;i<=n;i++){
			for (int j=1;j<=n;j++){
				cout << 0 << " ";
			}
			cout << "\n";
		}
		return 0;
	}
	
	int L=0,N=1;
	for (;N<=n;) N<<=1,L++;
	
	vector<int> gray;
	gray.push_back(0);
	for (int t=0;t<=L-2;t++){
		int sz=gray.size();
		for (int j=sz-1;j>=0;j--) gray.push_back(gray[j]|(1<<t));
	}
	/*
	{
		cerr << "------------" << endl;
		cerr << "L,N : " << L << " " << N << endl;
		for (auto x:gray){
			cerr << bitset<6>(x) << endl;
		}
		cerr << "----------" << endl;
	}
	*/
	{
		int sz=gray.size();
		for (int i=0;i<sz;i++) a[i*2]=gray[i];
		for (int i=0;i<sz;i++) a[i*2+1]=(~(a[i*2]|a[i*2+2]))&(N-1);
		for (int i=0;i<sz;i++) b[i*2+1]=a[i*2]&a[i*2+2];
		for (int i=0;i<sz;i++){
			b[i*2]|=a[i*2+1];
			b[i*2+2]|=a[i*2+1];
		}
	}
	/*
	{
		cerr << "------------" << endl;
		cerr << "L,N : " << L << " " << N << endl;
		for (int i=0;i<N;i++){
			cerr << bitset<6>(a[i]) << " " << bitset<6>(b[i]) << endl;
		}
		cerr << "----------" << endl;
	}
	*/
	for (int i=0;i<n;i++){
		for (int j=0;j<n;j++){
			int tmp1=a[i];
			int tmp2=a[j];
			if (i%2==1) tmp2=b[j];
			if (j%2==1) tmp1=b[i];
			ans[i][j]=(tmp1<<L)|tmp2;
		}
	}
	
	cout << "Yes" << "\n";
	for (int i=0;i<n;i++){
		for (int j=0;j<n;j++){
			cout << ans[i][j] << " ";
		}
		cout << "\n";
	}
	/*
	{
		for (int i=0;i<n-1;i++){
			for (int j=0;j<n-1;j++){
				if ((ans[i][j]&ans[i+1][j])!=0){
					cerr << "WA : " << i << " " << j << " " << i+1 << " " << j << endl;
				}
				if ((ans[i][j]&ans[i][j+1])!=0){
					cerr << "WA : " << i << " " << j << " " << i << " " << j+1 << endl;
				}
			}
		}
		vector<int> cnt(4*n*n);
		for (int i=0;i<n;i++){
			for (int j=0;j<n;j++){
				if (ans[i][j]<0 || ans[i][j]>4*n*n-1){
					cerr << "[0,4n^2-1] : " << i << " " << j << endl;
				}
				cnt[ans[i][j]]++;
				if (cnt[ans[i][j]]>5){
					cerr << "ex 5 times : " << i << " " << j << " " << ans[i][j] << endl;	
				}
			}
		}
	}
	*/
	/*
	{
		for (int i=0;i<n;i++){
			for (int j=0;j<n;j++){
				cerr << bitset<8>(ans[i][j]) << " ";
			}
			cerr << "\n";
		}	
	}
	*/
	return 0;	
}