#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>
#include <fstream>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int a[33][33];

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

template<class T> constexpr bool in_range(T y, T x, T H, T W) { return 0<=y&&y<H&&0<=x&&x<W; }

int main() {

  int N; cin >> N;
  int y = 0, x = 0;
  int k = 2;
  int cnt = 1;
  while(cnt <= N * N) {
    a[y][x] = cnt++;
    int ny = y + dy[k], nx = x + dx[k];
    if(!in_range(ny, nx, N, N) || a[ny][nx]) {
      k ++;
      k %= 4;
      ny = y + dy[k], nx = x + dx[k];
    }
    y = ny, x = nx;
  }

  rep(i, N) rep(j, N) {
    printf("%03d%c", a[i][j], j == N-1 ? '\n' : ' ');
  }
  
  return 0;
}