/**
	author:  shobonvip
	created: 2025.04.06 17:16:52
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
	vector a(n,vector<int>(n));
	int g=0;
	int p=1;

	if(n%2==1){
		a[0][0]=p;
		p++;
		rrep(j,0,n-1){
			if(j%2==0){
				a[0][j+1]=p;
				a[j+1][0]=p+1;
			}else{
				a[j+1][0]=p;
				a[0][j+1]=p+1;
			}
			p+=2;
		}
		g=1;
	}
	rep(j,0,n/2){
		if(j%2==0){
			rep(i,0,n/2){
				a[2*i+g][2*j+g] = p+0;
				a[2*i+g+1][2*j+g+1] = p+1;
				a[2*i+g][2*j+g+1] = p+2;
				a[2*i+g+1][2*j+g] = p+3;
				p+=4;
			}
		}else{
			rrep(i,0,n/2){
				a[2*i+g+1][2*j+g] = p+0;
				a[2*i+g][2*j+g+1] = p+1;
				a[2*i+g+1][2*j+g+1] = p+2;
				a[2*i+g][2*j+g] = p+3;
				p+=4;
			}	
		}
	}
	rep(i,0,n){
		rep(j,0,n){
			cout<<a[i][j]<<" ";
		}
		cout<<endl;
	}
}