#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 1010;

int n, tot, a[maxn][maxn];

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n;
  rep (i, 0, (n - 1) / 8) {
    rep (j, 0, (n - 1) / 18) {
      tot++;
      rep (x, 8 * i + 1, 8 * (i + 1)) {
        rep (y, 18 * j + 1, 18 * (j + 1)) {
          if (x <= n && y <= n) a[x][y] = tot;
        }
      }
    }
  }
  rep (i, 1, n) rep (j, 1, n) cout << a[i][j] << " \n"[j == n];
}