#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
#include <cassert>
#include <complex>
using namespace std;
//#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<int,P> Q;

int board[505][505];

int main() {
    int n;
    cin>>n;
    vector<int>a(n+1);
    for(int i=1;i<=n;i+=2){
        a[i]=(i+1)/2;
    }
    for(int i=2;i<n;i+=2){
        a[i]=(n/2+1)+i/2;
    }
    queue<int>que;
    for(int i=0;i<n;i++){
        que.push(a[i+1]);
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            int t = que.front();
            que.pop();
            cout<<t<<" ";
            que.push(t);
        }
        int t = que.front();
        que.pop();
        que.push(t);
        cout<<endl;
    }
}