#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[2050][2050], b[2050], m, ans[2050], used[2050], L, OK, c[2050];
void dfs(int x) {
	if (OK) return;
	if (x == L + 1) {
		// cerr << "AA ";
		// for (int i = 1; i <= L; i++) cerr << b[ans[i]] << ' ';
		// cerr << '\n';
		OK = 1;
		return;
	}
	for (int i = m; i >= 1; i--) {
		if (used[i]) continue;
		if (b[i] & b[ans[x - 1]]) continue;
		ans[x] = i;
		if (x == L && (b[i] & b[ans[1]])) continue;
		used[i] = 1, dfs(x + 1);
		used[i] = 0;
		if (OK) return;
	}
}
int cnt[20000005];
bool Bad(int x, int y) {
	if (x > 0 && (a[x][y] & a[x - 1][y])) return 1;
	if (y > 0 && (a[x][y] & a[x][y - 1])) return 1;
	if ((a[x][y] & a[x + 1][y])) return 1;
	if ((a[x][y] & a[x][y + 1])) return 1;
	return 0;
}
int main() {
	int n;
	cin >> n;
	int t = 1;
	while (t < n) t = 2 * t;
	for (int i = 0; i < t; i++) {
		if (__builtin_popcount(i) <= (t > 500 ? 6 : (t > 120 ? 5 : (t > 60 ? 4 : 3)))) b[++m] = i;
	}
	L = t / 2;
	dfs(1);
	for (int i = 0; i < t / 2; i++) {
		c[i] = c[i + t / 2] = b[ans[i + 1]];
	}
	for (int i = 0; i < t / 2; i++) {
		for (int j = 0; j < t; j++) {
			a[i][j] = c[(i + j) % t] + c[(j - i + t) % t] * t;
		}
	}
	for (int j = 0; j < t; j++) {
		a[t / 2][j] = c[(t / 2 + j) % t];
	}
	for (int i = t / 2 + 1; i < t; i++) {
		for (int j = 0; j < t; j++) {
			a[i][j] = c[(i + j) % t] + c[(j - i + t + 1) % t] * t;
		}
	}
	for (int i = 0; i < t; i++) {
		for (int j = 0; j < t; j++) {
			cnt[a[i][j]]++;
		}
	}
	for (int j = t / 2; j < t; j++) {
		cnt[a[t / 2][j]]--;
	}
	for (int j = t / 2; j < t; j++) {
		a[t / 2][j] = 0;
		while (cnt[a[t / 2][j]] == 5 || Bad(t / 2, j)) a[t / 2][j]++;
		cnt[a[t / 2][j]]++;
	}
	puts("Yes");
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cout << a[i][j] << ' ';
		}
		cout << '\n';
	}
}