#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>


using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>


ll n;
vector<ll> a, b;
int main() {
	cin >> n;
	REP(i, n / 2) {
		vector<ll> now;
		for (int j = i * n * 2 + 1; j <= (i + 1) * n * 2; j += 2)
		{
			now.push_back(j);
		}
		if (i % 2 == 1)reverse(ALL(now));
		REP(j, now.size()) {
			if (j != 0)cout << " ";
			cout << now[j];
		}
		cout << endl;
	}
	REP(i, n / 2) {
		vector<ll> now;
		for (int j = i * n * 2 + 2; j <= (i + 1) * n * 2; j += 2)
		{
			now.push_back(j);
		}
		if (i % 2 == 0) {
			reverse(ALL(now));
			reverse(now.begin() + n / 2, now.end());
		}
		else {
			reverse(now.begin(), now.end() - n / 2);
		}
		REP(j, now.size()) {
			if (j != 0)cout << " ";
			cout << now[j];
		}
		cout << endl;
	}
}