#include <iostream>
#include <algorithm>
#define llint long long

using namespace std;

llint n;
int ans[305][305];

int main(void)
{
	cin >> n;
	int id = 1;
	for(int j = 0; j < n/2; j++){
		if(j%2 == 0){
			for(int i = 0; i < n; i++){
				ans[i][j] = id++;
				ans[(i+n/2)%n][j+n/2] = id++;
			}
		}else{
			for(int i = 0; i < n; i++){
				ans[n-1-i][j] = id++;
				ans[n-1-(i+n/2)%n][j+n/2] = id++;
			}
		}
	}
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			cout << ans[i][j] << " ";
		}
		cout << endl;
	}
	
	return 0;
}