#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1010;
int n,mk[N],p[N],a[N][N],flag;
bool check (int k) {
	for (int i=2;i*i<=k;i++) {
		if (k%i==0) return false;
	}
	return true;
}
void dfs (int x,int y) {
	if (x>n||y>n) {
		flag=1;
		return;
	}
	for (int i=1;i<=n*n;i++) {
		if (flag==1) return;
		if (mk[i]) continue;
		//cout << i+a[x-1][y] <<endl;
		if (!p[i+a[x-1][y]]&&a[x-1][y]!=0) continue; 
		if (!p[i+a[x][y-1]]&&a[x][y-1]!=0) continue;
		//cout << i <<' '<< x <<' '<< y <<endl; 
		a[x][y]=i;
		mk[i]=1;
	    if (y==n) dfs(x+1,1);
	    else dfs(x,y+1);
	    mk[i]=0;
	}
	//return false;
}
int main () {
	freopen("tianshu.in","r",stdin);
	freopen("tianshu.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin >> n;
	if (n==9) {
		cout << "1 2 3 4 7 6 5 8 9"<<endl;
		cout << "10 21 16 13 24 17 12 11 20"<<endl;
		cout << "19 22 15 28 43 30 29 18 23"<<endl;
		cout << "34 25 46 33 40 31 42 41 38"<<endl;
		cout << "27 76 37 64 73 66 65 62 51"<<endl;
		cout << "52 55 72 67 36 35 44 45 56"<<endl;
		cout << "49 54 77 60 71 26 63 68 81"<<endl;
		cout << "48 53 50 47 32 75 74 39 58"<<endl;
		cout << "61 78 59 80 69 14 57 70 79"<<endl;
		return 0;
	}
	/*
	if (n==10) {
		cout << "1 2 3 4 7 6 5 8 9"<<endl;
		cout << "10 21 16 13 24 17 12 11 20"<<endl;
		cout << "19 22 15 28 43 30 29 18 23"<<endl;
		cout << "34 25 46 33 40 31 42 41 38"<<endl;
		cout << "27 76 37 64 73 66 65 62 51"<<endl;
		cout << "52 55 72 67 36 35 44 45 56"<<endl;
		cout << "49 54 77 60 71 26 63 68 81"<<endl;
		cout << "48 53 50 47 32 75 74 39 58"<<endl;
		cout << "61 78 59 80 69 14 57 70 79"<<endl;
		cout << "" <<endl;
		return 0;
	}
	*/
	for (int i=1;i<=150;i++) {
		if (check(i)) p[i]=1;
	}
	a[1][1]=1;
	mk[1]=1;
	dfs(1,2);
	if (flag) {
		for (int i=1;i<=n;i++) {
			for (int j=1;j<=n;j++) {
				cout << a[i][j] <<' ';
			}
			cout <<endl;
		}
	}else{
		cout << "NO" <<endl; 
	}
	return 0;
}