#ifdef LOCAL111
#else
	#define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e8;
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
#else
	#define DEBUG(x) true
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define rangej(a,b,c) ((a) <= (c) and (c) < (b))
#define rrangej(b,c) rangej(0,b,c)
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << setfill('0') << setw(3) << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef pair<int,int> P;
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<LL,LL> LP;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

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

int n;
inline bool check(int x, int y){
	return (0 <= x and x < n and 0 <= y and y < n);
}

int main()
{
	ios_init();
	cin >> n;
	vector<vector<int>> v(n,vector<int>(n,-1));
	int di = 0;
	int x = 0, y = 0;
	int num = 1;
	while(num <= n*n){
		v[x][y] = num;
		num ++;
		if(!check(x+dx[di], y+dy[di]) or v[x+dx[di]][y+dy[di]] != -1){
			DEBUG(1);
			di = (di+1)%4;
		}
		x += dx[di];
		y += dy[di];
		DEBUG(endl);
	}
	REP(i,n) pite(ALL(v[i]));
	return 0;
}