#include<bits/stdc++.h>
using namespace std;
typedef long long lg;
typedef unsigned long long ulg;
typedef long double ld;
#define mkp make_pair
#define pb push_back
#define endl "\n"
const int N = 35, M = 2e5 + 5, INFi = 1e9 + 123, MOD = 1e9 + 7, KEY = 1001;
const lg INFl = 1e18 + 123;
const double EPS = 0.00000001, INFd = 1e18 + 1234.9;
template<typename T> inline T sqr(T t) { return t * t; }
inline void file() {
    //cout.precision(9); cout<<fixed;
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    #ifdef _WIN32
    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    #endif
}
int n;
bool used[N][N];
queue<pair< int, pair<int, int> > > q;
inline void check(int x, int y, int cost){
    if (x < 0 || x >= n || y < 0 || y >= n || used[x][y]) return;
    used[x][y] = true;
    q.push(mkp(cost, mkp(x, y)));
}
inline int solve(int a, int b){
    for (int i=0; i<N; i++)
        for (int j=0; j<N; j++)
            used[i][j] = false;
    while (!q.empty()) q.pop();
    q.push(mkp(0, mkp(0, 0)));
    while (!q.empty()){
        int x = q.front().second.first;
        int y = q.front().second.second;
        int cost = q.front().first;
        if (x == n - 1 && y == n - 1) return cost;
        q.pop();
        cost++;
        check(x + a, y + b, cost);
        check(x - a, y + b, cost);
        check(x + a, y - b, cost);
        check(x - a, y - b, cost);
        check(x + b, y + a, cost);
        check(x - b, y + a, cost);
        check(x + b, y - a, cost);
        check(x - b, y - a, cost);
    }
    return -1;
}
int main(){
    file();
    cin>>n;
    for (int i=1; i<n; i++) {
        for (int j=1; j<n; j++)
            cout<<solve(i, j)<<" ";
        cout<<endl;
    }
}