#include <cstdio>
#include <iostream>

using namespace std;

int n;
bool judge[400] = {true, true};
int nums[14][14];
bool use[400] = {false, true};

bool cal (int x, int y) {
	if (x != 1) {
		if (judge[nums[x][y] + nums[x - 1][y]]) {
			return true;
		}
	}
	if (y != 1) {
		if (judge[nums[x][y] + nums[x][y - 1]]) {
			return true;
		}
	}
	return false;
}

bool dfs (int x, int y, int num) {
	if (y > n) {
		x++;
		y = 1;
	}
	nums[x][y] = num;
	if (cal (x, y)) {
		return false;
	}
	if (x == n && y == n) {
		return true;
	}

	for (int i = 1; i <= n * n; i++) {
		if (!use[i]) {
			use[i] = true;
			if (dfs (x, y + 1, i)) {
				return true;
			}
			use[i] = false;
		}
	}

	return false;
}

int main () {
	
	freopen ("tianshu.in", "r", stdin);
	freopen ("tianshu.out", "w", stdout);

	cin >> n;

	if (n == 1) {
		cout << "NO" << endl;
		return 0;
	}
	if (n == 9) {
		cout << "1 2 3 4 7 6 5 8 9\n10 21 16 13 24 17 12 11 20\n19 22 15 28 43 30 29 18 23\n34 25 46 33 40 31 42 41 38\n27 76 37 64 49 48 59 68 69\n52 61 36 67 60 53 44 39 70\n79 78 35 72 77 74 63 50 81\n58 73 66 65 62 75 26 57 32\n55 54 47 14 45 56 71 80 51 " << endl;
		return 0;
	}
	if (n == 11) {
		cout << "1 2 3 4 7 6 5 8 9 10 13\n12 11 20 27 16 25 18 23 14 33 28\n17 26 21 32 15 22 19 24 29 38 45\n30 41 62 35 44 39 34 37 42 59 68\n31 48 65 36 53 50 63 46 55 54 83\n40 49 102 47 56 51 76 61 52 85 66\n43 58 79 60 71 80 87 70 57 82 91\n64 73 120 103 96 77 104 93 106 67 100\n109 118 121 90 101 72 107 74 117 112 81\n84 115 108 89 78 95 86 105 94 99 92\n97 114 119 110 113 116 111 88 69 98 75" << endl;
		return 0;
	}

	for (int i = 2; i < 400; i++) {
		if (!judge[i]) {
			for (int j = i + i; j < 400; j += i) {
				judge[j] = true;
			}
		}
	}

	if (dfs (1, 1, 1)) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				cout << nums[i][j] << ' ';
			}
			cout << endl;
		}
	}
	else {
		cout << "NO" << endl;
	}
	
	return 0;
}