//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int ans[2002][2002];
int cnt[16004000];
mt19937 rnd(time(NULL));
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			int rm=((1<<30)-1)^(ans[i-1][j]|ans[i][j-1]);
			int res=-1;
			for(int x=0;x<20;x++)
			{
				int cho=(rnd()%(4*n*n))&rm;
				if(res==-1||cnt[cho]<cnt[res])
					res=cho;
			}
			assert((res&ans[i-1][j])==0);
			assert((res&ans[i][j-1])==0);
			ans[i][j]=res;
			cnt[res]++;
			if(cnt[res]>5||res==-1) die("No");
		}
	cout<<"Yes"<<endl;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
			cout<<ans[i][j]<<" ";
		cout<<'\n';
	}
	return 0;
}