#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

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

bool check(int x, int y, const vector<vector<int> > &bd) {
  if (x < 0 || x >= bd.size()) return false;
  if (y < 0 || y >= bd.size()) return false;
  return bd[y][x] == 0;
}

int main() {
  int n;
  cin >> n;
  vector<vector<int> > bd(n, vector<int>(n));

  int v = 0, x = 0, y = 0;
  int cnt = 1;
  while (cnt <= n * n) {
    bd[y][x] = cnt;
    if (!check(x + dx[v], y + dy[v], bd)) {
      v = (v + 1) % 4;
    }
    y += dy[v];
    x += dx[v];
    ++cnt;
  }
  
  REP (i, n) REP (j, n) printf("%03d%c", bd[i][j], j == n-1 ? '\n' : ' ');

  return 0;
}