#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

set<pair<int,int> > possibleMoves(int x, int y, int a, int b) {
    
    set<pair<int,int> > possibleMoves;
    
    possibleMoves.insert(make_pair(x+a, y+b));
    possibleMoves.insert(make_pair(x+a, y-b));
    possibleMoves.insert(make_pair(x-a, y+b));
    possibleMoves.insert(make_pair(x-a, y-b));
    
    possibleMoves.insert(make_pair(x+b, y+a));
    possibleMoves.insert(make_pair(x+b, y-a));
    possibleMoves.insert(make_pair(x-b, y+a));
    possibleMoves.insert(make_pair(x-b, y-a));
    
    return possibleMoves;
}


int minimumMoves(int a, int b, int n) {
    int n_moves = -1;
    int steps = 0;
    set<pair<int,int> > visited;
    set<pair<int,int> > to_visit;
    pair<int,int> origin = make_pair(0,0);
    pair<int,int> destination = make_pair(n-1,n-1);
    
    to_visit.insert(origin);
    
    while(to_visit.size() > 0) {
       
        set<pair<int,int> > to_visit_in_next_step;
        
        for(set<pair<int,int> >::iterator it=to_visit.begin(); it!=to_visit.end(); ++it) {
            if(visited.find(*it) != visited.end()) continue;
            visited.insert(*it);
            int x1 = (*it).first;
            int y1 = (*it).second;
            
            set<pair<int,int> > possible_moves = possibleMoves(x1,y1,a,b);
            for(set<pair<int,int> >::iterator itp = possible_moves.begin(); itp != possible_moves.end(); ++itp) {
                int x2 = (*itp).first;
                int y2 = (*itp).second;
                if(x2 >= 0 && x2 < n && y2 >= 0 && y2 < n) to_visit_in_next_step.insert(make_pair(x2,y2));
            }
        }
        
        to_visit = to_visit_in_next_step;
        steps++;
        
        if(to_visit_in_next_step.find(destination) != to_visit_in_next_step.end()) {
            n_moves = steps;
            break;
        }
    }
    
    return n_moves;
}

int main(){
    
    map<pair<int,int>, int> moves;
    pair<int,int> idx;
    
    int n;
    cin >> n;
    
    // your code goes here
    for(int i=1; i<n; i++) {
        for(int j=1; j<n; j++) {
            idx = make_pair(j,i);
            if(moves.find(idx) == moves.end()) {
                idx = make_pair(i,j);
                moves.insert(make_pair(idx, minimumMoves(i,j,n)));
            }
            cout << moves[idx] << (j<(n-1) ? " " : "");
        }
        cout << endl;
    }
    return 0;
}