#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;

/*
*/

ll n,a[310][310];

void init(){
	cin>>n;
}

int main(void){
	init();
	rep(i,n*n/4){
		a[i/(n/2)][i%(n/2)]=i*2+1;
		a[i/(n/2)+(n/2)][i%(n/2)+(n/2)]=i*2+2;
	}
	rep(i,n*n/4){
		a[i/(n/2)][n-1-i%(n/2)]=i*2+1+n*n/2;
		a[i/(n/2)+(n/2)][n/2-1-i%(n/2)]=i*2+2+n*n/2;
	}
	rep(i,n){
		rep(j,n)cout<<a[i][j]<<(j<n-1?" ":"");
		cout<<endl;
	}
	return 0;
}