#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<class Val>
void printvv(const vector<vector<Val> > &vv){
    for(size_t i = 0; i < vv.size(); i++)
        for(size_t j = 0; j < vv[i].size(); j++)
            printf("%d%c", vv[i][j], j + 1 != vv[i].size() ? ' ' : '\n');
}

bool isMagicSquare(vector<vector<int> > ms){
    int n = (int)ms.size();
    long long need = n*(n*n + 1ll)/2;
    for(int i = 0; i < n; ++i){
        long long sumr = 0, sumc = 0;
        for(int j = 0; j < n; ++j){
            sumr += ms[i][j];
            sumc += ms[j][i];
        }
        if(sumr != need || sumc != need)return false;
    }
    long long suma = 0, sumb = 0;
    for(int i = 0; i < n; ++i){
        suma += ms[i][i];
        sumb += ms[i][n - 1 - i];
    }
    return suma == need&&sumb == need;
}

const int LUX[3][2][2] = {{{4,1},{2,3}},{{1,4},{2,3}},{{1,4},{3,2}}};
vector<vector<int> > makeMagicSquare(int n){
    vector<vector<int> > res(n, vector<int>(n));
    if(n % 2 == 1){
        int y = 0, x = n / 2, cur = 0;
        while(cur < n*n){
            while(!res[y][x]){
                res[y][x] = ++cur;
                if(--y < 0)y = n - 1;
                if(++x >= n)x = 0;
            }
            (y += 2) %= n;
            if(--x < 0)x = n - 1;
        }
    } else if(n % 4 == 0){
        int cur = 0;
        for(int y = n - 1; y >= 0; --y)
            for(int x = n - 1; x >= 0; --x)
                res[y][x] = ++cur;
        const int off = n*n + 1;
        for(int sy = 0; sy < n; sy += 4){
            for(int sx = 0; sx < n; sx += 4)
                for(int i = 0; i < 4; ++i)
                    res[sy + i][sx + i] = off - res[sy + i][sx + i];
            for(int sx = 3; sx < n; sx += 4)
                for(int i = 0; i < 4; ++i)
                    res[sy + i][sx - i] = off - res[sy + i][sx - i];
        }
    } else{
        vector<vector<int> > sub = makeMagicSquare(n / 2);
        const int m = n / 2;
        for(int i = 0; i < m; ++i)
            for(int j = 0; j < m; ++j)
                sub[i][j] = 4 * (sub[i][j] - 1);
        auto f = [&](int r, int c, int lux){
            int val = sub[r][c];
            r *= 2;
            c *= 2;
            for(int i = 0; i < 2; ++i)
                for(int j = 0; j < 2; ++j)
                    res[r + i][c + j] = val + LUX[lux][i][j];
        };
        for(int i = 0; i <= m / 2; ++i)
            for(int j = 0; j < m; ++j)
                f(i, j, 0);
        for(int j = 0; j < m; ++j)
            f(m / 2 + 1, j, 1);
        for(int i = m / 2 + 2; i < m; ++i)
            for(int j = 0; j < m; ++j)
                f(i, j, 2);
        f(m / 2, m / 2, 1);
        f(m / 2 + 1, m / 2, 0);
    }
    return res;
}

int main(){
    int N;
    while(cin >> N){
        auto ans = makeMagicSquare(N);
        assert(isMagicSquare(ans));
        printvv(ans);
    }
}