#include<iostream>
#include<fstream>
#include<string>
#include<cstring>
#include<stdio.h>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<queue>
#include<list>
#include<stdio.h>
#include<stdlib.h>
#include<map>
#include<cstdio>
#include <iomanip>


using namespace std;


template<class T>bool chmax(T &a, const T &b) { return (a<b) ? (a = b, 1) : 0; }
template<class T>bool chmin(T &a, const T &b) { return (b<a) ? (a = b, 1) : 0; }

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

typedef int _loop_int;
#define rep(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)

typedef vector<int> vi;
typedef pair<int, int> pii;


int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };

vector<vector<int>> board;

bool ok(int y, int x,int N) {
	bool isInY = y >= 0 && y <= N-1;
	bool isInX = x >= 0 && x <= N-1;

	return isInY && isInX;
}

int main() {
	
	int N; cin >> N;

	int x = 0; int y = 0;

	int direct = 0;

	board.resize(N);
	for (int i = 0; i < N; i++) {
		board[i].resize(N,0);
	}

	for (int i =0; i < N*N; i++) {

		board[y][x] = i + 1;

		if (!ok(x + dx[direct], y + dy[direct], N) || board[y + dy[direct]][x + dx[direct]]!=0) {
			direct = (direct + 1) % 4;
		}

		x += dx[direct];
		y += dy[direct];

	}
	
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			printf("%03d", board[i][j]);

			if (j != N - 1) {
				cout << " ";
			}
		}

		cout << endl;
	}

	return 0;
}