#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e6 + 5;
const ll dt = 0;
namespace space_and_Lqy{
    int N;
    int A[303][303];

    void solve() {
        int i,j,k,l,r,x,y; string s;
        
        cin>>N;
        int cur=1;
        for(int y = 0;y < N/2; y++) for(int x = 0; x < N/2; x++) {
            A[y][x]=cur++;
            A[y+N/2][x+N/2]=cur++;
        }
        for(int y = 0;y < N/2; y++) for(int x = 0; x < N/2; x++) {
            A[y][N-1-x]=cur++;
            A[y+N/2][N/2-1-x]=cur++;
        }
        
        for(int y = 0; y < N; y++) {
            for(int x = 0; x < N; x++) cout<<A[y][x]<<" ";
            cout<<endl;
        }
        
    }
};
int main(){
    ll T = 1;
    if(dt)cin >> T;
    while(T--){
        space_and_Lqy::solve();
    }
    return 0;
}