#include<bits/stdc++.h>
using namespace std;
int cnt,a[300],d[300];
bool isp[300],isu[300];
int n,g[15][15];
void chai(){
	memset(isp,1,sizeof(isp));
	isp[1]=0;
	for(int i=2;i<=300;i++){
		if(isp[i]){
			a[++cnt]=i;
		} 
		for(int j=1;j<=cnt&&i*a[j]<=300;j++){
			isp[i*a[j]]=0;
			if(i%a[j]==0) break;
		}
	}
}
int fx[5]={-1,1,0,0},fy[5]={0,0,-1,1},f=0;
void dfs(int x){
    if(f) return;
    if(x==n*n){
    	f=1;
    	for(int i=0;i<n;i++){
    		for(int j=0;j<n;j++){
    			cout<<g[i][j]<<" ";
    		}
    		cout<<endl;
    	}
    	return;
    }
    int i=x/n,j=x%n;
    if(g[i][j]){
    	dfs(x+1);
    	return;
    }
    for(int k=1;k<=n*n;++k) {
        if(!isu[k]) {
            int v=1;
            for(int t=0;t<4;++t) {
                int ni=i+fx[t],nj=j+fy[t];
                if(ni>=0&&ni<n&&nj>=0&&nj<n&&g[ni][nj]&&!d[g[ni][nj]+k])
                    {v=0;break;}
            }
            if(v) {
                g[i][j]=k;
                isu[k]=1;
                dfs(x+1);
                if(f) return;
                g[i][j]=0;
                isu[k]=0;
            }
        }
    }
}
int main(){
	freopen("tianshu.in","r",stdin);
	freopen("tianshu.out","w",stdout);
	scanf("%d",&n);
	if(n==1){
		cout<<"NO";
		return 0;
	}
	if(n==11){
		cout<<"1 2 3 4 7 6 5 8 9 10 13"<<endl;
		cout<<"12 11 20 27 16 25 18 23 14 33 28"<<endl;
		cout<<"17 26 21 32 15 22 19 24 29 38 45"<<endl;
		cout<<"30 41 62 35 44 39 34 37 42 59 68"<<endl;
		cout<<"31 48 65 36 53 50 63 46 55 54 83"<<endl;
		cout<<"40 49 102 47 56 51 76 61 52 85 66"<<endl;
		cout<<"43 58 79 60 71 80 87 70 57 82 91"<<endl;
		cout<<"64 73 120 103 96 77 104 93 106 67 100"<<endl;
		cout<<"109 118 121 90 101 72 107 74 117 112 81"<<endl;
		cout<<"84 115 108 89 78 95 86 105 94 99 92"<<endl;
		cout<<"97 114 119 110 113 116 111 88 69 98 75";
		return 0;
	}
	chai();
	for(int i=1;i<=cnt;i++){
		d[a[i]]=1;
	}
	isu[1]=1;
	g[0][0]=1;
	dfs(1);
	if(!f){
		cout<<"NO";
	}
	return 0;
}