#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
using namespace std;
using ll = long long;

int main() {
  int n;
  cin >> n;
  vector<vector<int>> ans(n, vector<int>(n, -1));
  int y = 0;
  int x = 0;
  ans[0][0] = 1;
  for (int i = 2; i <= n * n; i++) {
    tuple<int, int, int> t(-1, -1, -1);
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (ans[i][j] != -1) continue;
        int cost = (y - i) * (y - i) + (x - j) * (x - j);
        t = max(t, make_tuple(cost, i, j));
      }
    }
    y = get<1>(t);
    x = get<2>(t);
    ans[y][x] = i;
  }
  rep(i, n) {
    rep(j, n) {
      cout << ans[i][j] << ' ';
    }
    cout << '\n';
  }
}