#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, l, r) for(ll i = (l); i < (r); ++i)
#define all(X) (X).begin(), (X).end()

void solve() {
    ll n;
    cin >> n;
    vector ans(n, vector<ll>(n));
    ll x = (n + 7) / 8;
    rep(i, 0, n) rep(j, 0, n) {
        ll a = i / 8;
        ll b = j / 8;
        ans[i][j] = (x * a + b) / 2 + 1;
    }

    rep(i, 0, n) { rep(j, 0, n) cout << ans[i][j] << " \n"[j + 1 == n]; }
}

int main() {
    int t = 1;
    // cin >> t;
    while(t--) solve();
}