#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

vector<int> dy={0,1,0,-1};
vector<int> dx={1,0,-1,0};

int in(int y,int x,int N){
  return 0<=y&&y<N && 0<=x&&x<N;
}
int main(){
  int N; cin >> N;
  vector<vector<int>> A(N,vector<int>(N,-1));
  int y=0,x=0;
  A[y][x]=1;
  int d=0;
  for(int i=2;i<=N*N;i++){
    if(!in(y+dy[d],x+dx[d],N) || A[y+dy[d]][x+dx[d]]!=-1) d=(d+1)%4;
    int ny=y+dy[d],nx=x+dx[d];
    A[ny][nx]=i;
    y=ny,x=nx;
  }
  rep(i,N){
    rep(j,N){
      if(j) printf(" ");
      printf("%03d",A[i][j]);
    }
    printf("\n");
  }
  return 0;
}