#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<queue>
#include<map>
#define ll long long
using namespace std;
int n,a[505][505];
int main(){
	scanf("%d",&n);
	printf("Yes\n");
	a[1][1]=1,a[1][2]=2,a[2][1]=3,a[2][2]=4;
	for(int i=3;i<=n;++i) a[1][i]=a[2][i]=a[i][1]=a[i][2]=5;
	int now=6;
	for(int i=3;i<=n;++i){
		for(int j=3;j<=n;++j){
			if((i+j)%2==0) a[i][j]=now;
		}
	}
	for(int i=3;i<=n-2;++i){
		now++;
		for(int j=3;j<=n;++j){
			if((i+j)%2) a[i][j]=now;
		}
	}
	for(int i=max(n-1,3);i<=n;++i){
		for(int j=3;j<=n;++j){
			if((i+j)%2) now++,a[i][j]=now;
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j) printf("%d ",a[i][j]);
		printf("\n");
	}
}