#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define pb eb
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define all2(i,j,v) for(auto& [i,j] : v)
template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

// cin.tie(nullptr);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);

void solve(){
  ll n;
  cin >> n;
  V<ll> dx={0,1,0,-1};
  V<ll> dy={1,0,-1,0};
  VV<ll> v(n+2, V<ll>(n+2, 0));
  REP(i,1,n+1) REP(j,1,n+1) v[i][j] = -1;
  ll cnt = 0;
  ll x = 1, y = 0, id = 0;
  do{
    while(v[x+dx[id]][y+dy[id]]!=-1) id = (id+1)%4;
    x += dx[id];
  	y += dy[id];
  	cnt++;
  	v[x][y] = cnt;
  }while(cnt<n*n);
  REP(i,1,n+1){
  	REP(j,1,n+1){
  		if(v[i][j]<100) cout << "0";
  		if(v[i][j]<10) cout << "0";
  		cout << v[i][j] << " ";
  	}
  	cout << endl;
  }
  
}





int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t=1;
  // cin >> t;
  rep(i,t) solve();
}