#include <bits/stdc++.h>

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

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

void print(vector<vector<int> > mat) {
    int n = mat.size();
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << mat[i][j];
            if (j < n-1) cout << " ";
        }
        cout << endl;
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<vector<int> > mat(n, vector<int>(n));
    if (n % 2 == 1) {
        mat[0][n/2] = 1;
        int y = 0, x = n/2;
        int cur = 2;
        for (int i = 0; i < n*n-1; i++) {
            y = (y+n-1)%n;
            x = (x+1)%n;
            if (mat[y][x] != 0) {
                y = (y+2)%n;
                x = (x+n-1)%n;
            }
            mat[y][x] = cur++;
        }
    } else if (n % 4 == 0) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                int tmp = n*i+j+1;
                if (i%4 == 0 || i % 4 == 3) {
                    if (j%4 == 0 || j % 4 == 3) {
                        mat[i][j] = tmp;
                    }
                } else {
                    if (j%4 == 1 || j%4 == 2) {
                        mat[i][j] = tmp;
                    }
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                int tmp = n*i+j+1;
                if (mat[n-1-i][n-1-j] == 0) mat[n-1-i][n-1-j] = tmp;
            }
        }
    } else {
        int N = n/2;
        for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) mat[i][j] = -1;
        vector<vector<int> > mm(N, vector<int>(N, -1));
        mm[0][N/2] = 0;
        int y = 0, x = N/2;
        int cur = 1;
        for (int i = 0; i < N*N-1; i++) {
            y = (y+N-1)%N;
            x = (x+1)%N;
            if (mm[y][x] != -1) {
                y = (y+2)%N;
                x = (x+n-1)%N;
            }
            mm[y][x] = cur*4;
            cur++;
        }
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (i <= N/2) {
                    if (j != N/2 || i != N/2) {
                        mat[i*2][j*2] = mm[i][j]+4;
                        mat[i*2][j*2+1] = mm[i][j]+1;
                        mat[i*2+1][j*2] = mm[i][j]+2;
                        mat[i*2+1][j*2+1] = mm[i][j]+3;
                    } else {
                        mat[i*2][j*2] = mm[i][j]+1;
                        mat[i*2][j*2+1] = mm[i][j]+4;
                        mat[i*2+1][j*2] = mm[i][j]+2;
                        mat[i*2+1][j*2+1] = mm[i][j]+3;
                    }
                } else if (N/2+1 < i && i <= N-1) {
                    mat[i*2][j*2] = mm[i][j]+1;
                    mat[i*2][j*2+1] = mm[i][j]+4;
                    mat[i*2+1][j*2] = mm[i][j]+3;
                    mat[i*2+1][j*2+1] = mm[i][j]+2;
                } else {
                    if (j == N/2 && i == N/2+1) {
                        mat[i*2][j*2] = mm[i][j]+4;
                        mat[i*2][j*2+1] = mm[i][j]+1;
                        mat[i*2+1][j*2] = mm[i][j]+2;
                        mat[i*2+1][j*2+1] = mm[i][j]+3;
                    } else {
                        mat[i*2][j*2] = mm[i][j]+1;
                        mat[i*2][j*2+1] = mm[i][j]+4;
                        mat[i*2+1][j*2] = mm[i][j]+2;
                        mat[i*2+1][j*2+1] = mm[i][j]+3;
                    }
                }
            }
        }
    }
    print(mat);
    return 0;
}