#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>

typedef long long ll;

using namespace std;

int uzu[31][31];
bool trac[31][31];


int main() {

	int n=0;
	cin>>n;

	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			trac[i][j] = true;
		}
	}


	queue<int> q;
	q.push(1);

	int x=0,y=0;

	while(!q.empty()){

		int tmp = q.front();q.pop();

		if(tmp >n*n){
			continue;
		}
		trac[y][x] =false;

		uzu[y][x] = tmp;

		if(trac[y][x+1] == true && x+1<n){

			if(trac[y-1][x] == true && y-1>=0){
							q.push(tmp+1);
							y--;;
							continue;
						}

			q.push(tmp+1);
			x++;
			continue;
		}

		if(trac[y+1][x] == true && y+1<n){
			q.push(tmp+1);
			y++;
			continue;
		}
		if(trac[y][x-1] == true && x-1>=0){
			q.push(tmp+1);
			x--;;
			continue;
		}
		if(trac[y-1][x] == true && y-1>=0){
					q.push(tmp+1);
					y--;;
					continue;
				}


	}

	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
				cout<<setfill('0')<<right<<setw(3)<<uzu[i][j]<<" ";
		}
		cout<<endl;
	}
/*	cout<<setfill('0')<<right<<setw(3)<<10<<endl;*/

	return 0;
}