#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <deque>
using namespace std;

struct pos {
    int x;
    int y;
    int m;
};
    
int main() {
    int n;
    cin >> n;
    
    for (int i=1; i<n; ++i) {
        for (int j=1; j<n; ++j) {
            auto board = vector<vector<int> >(n, vector<int>(n, -1));
            board[0][0]=0;
            deque<pos> places = {pos{i,j,1}, pos{j,i,1}};
            while (!places.empty()) {
                auto p = places.front();
                if (p.x>=0 && p.x<n && p.y>=0 && p.y<n && board[p.x][p.y]==-1) {
                    board[p.x][p.y] = p.m;
                    places.push_back({p.x+i, p.y+j, p.m+1});
                    places.push_back({p.x+i, p.y-j, p.m+1});
                    places.push_back({p.x-i, p.y+j, p.m+1});
                    places.push_back({p.x-i, p.y-j, p.m+1});
                    places.push_back({p.x+j, p.y+i, p.m+1});
                    places.push_back({p.x+j, p.y-i, p.m+1});
                    places.push_back({p.x-j, p.y+i, p.m+1});
                    places.push_back({p.x-j, p.y-i, p.m+1});
                }
                places.pop_front();
            }
            cout << board[n-1][n-1] << " ";
        }
        cout << endl;
    }
    
    return 0;
}