#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}
// end of template
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

template <typename T> inline void voutput(T &v){
    rep(i, v.size()){
        if (i) cout << " " << v[i];
        else cout << v[i];
    }
    cout << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    int N;
    cin >> N;
    vector<vector<int>> A(N, vector<int>(N, 0));
    int a = 1;
    int d = 0;
    int x = -1, y = 0;
    while(a <= N * N){
        if(y + dy[d] >= 0 && x + dx[d] >= 0 && y + dy[d] < N && x + dx[d] < N && A[y + dy[d]][x + dx[d]] == 0){
            A[y + dy[d]][x + dx[d]] = a;
        }
        else{
            d++;
            d %= 4;
            A[y + dy[d]][x + dx[d]] = a;
        }
        y += dy[d], x += dx[d];
        a++;
    }
    vector<vector<string>> B(N, vector<string>(N));
    rep(i, N) rep(j, N) {
        B[i][j] = to_string(A[i][j]);
        if(B[i][j].size() == 1) B[i][j] = "00" + B[i][j];
        if(B[i][j].size() == 2) B[i][j] = "0" + B[i][j];
    }
    
    rep(i, N) voutput(B[i]);
    
    return 0;
}