#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N; cin >> N;
    vector<int> A;
    for (int i = 1; i <= N; i++) {
        if (i&1) A.emplace_back(i);
    }
    for (int i = 1; i <= N; i++) {
        if (~i&1) A.emplace_back(i);
    }
    vector<vector<int>> ans(N, vector<int>(N));
    rep(i,N) {
        rep(j,N) {
            if (A[j]==i+1) {
                int cur = j;
                for (int k = i; k < i+N; k++) {
                    ans[i][k%N] = A[cur%N];
                    cur++;
                }
                break;
            }
        }
    }

    rep(i,N) {
        rep(j,N) cout << ans[i][j] << " ";
        cout << ln;
    }
}