#include <bits/stdc++.h>
using namespace std;
int n,g[22][22]={0};
bool s[122]={};
int sushu(int x){
	if(x<2) 
    return 0;
	for(int j=2;j*j<=x;j++)
		if(x%j==0) 
        return 0;
	return 1;
}
bool check2(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(g[i][j]==0){
                for(int k=2;k<=n*n;k++){
                    if(i-1<=n && i-1>=1 && g[i-1][j]!=0)
                      if(!sushu(k+g[i-1][j]))
                      continue;
                    if(j-1<=n && j-1>=1 && g[i][j-1]!=0)
                      if(!sushu(k+g[i][j-1]))
                      continue;
                    if(s[k]==1)
                    continue;
                    g[i][j]=k;
                    s[k]=1;
                    if(check2()==1)
                    return 1;
                    g[i][j]=0;
                    s[k]=0;
                }
                return 0;
            }
        }
    }
    return 1;
}
int main() {
    freopen("tianshu.in", "r", stdin);
    freopen("tianshu.out", "w", stdout);
    cin>>n;
    
    for(int i=2;i<=n*n;i++)
        s[i]=0;
    g[1][1]=1;
    if(check2()==1){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)cout<<g[i][j]<<' ';
        cout<<endl;
     }
    }
    else
    cout<<"NO";
    return 0;
}