#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define per(i, a, b) for(int i = (int)a; i >= (int)b; i --)
#define ll long long
using namespace std;

void solve() {
    int n;
    cin >> n;
    vector < vector < int > > a(n + 5, vector < int > (n + 5));
    rep(i, 1, n - 2) rep(j, 1, n) a[i][j] = i;
    rep(i, 1, n - 2) a[n - 1][i] = a[n][i] = i + n - 2;
    a[n - 1][n - 1] = 2 * n - 3;
    a[n - 1][n] = 2 * n - 2;
    a[n][n - 1] = 2 * n - 1;
    a[n][n] = 2 * n;
    rep(i, 1, n) rep(j, 1, n) cout << a[i][j] << " \n"[j == n];
}
int main() {
// #define LOCAL
#ifdef LOCAL
    freopen("data.in", "r", stdin);
#endif
    ios :: sync_with_stdio(false);
    cin.tie(0);
    int T = 1;
    // cin >> T;
    while(T --) solve();
    return 0;
}