#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>

#define DBG 0

using namespace std;

int record;

bool vector_pair_sort(pair<int, int>i, pair<int, int>j){
    if(DBG){
        cerr << "vector_pair_sort i1: " << i.first << "," << i.second 
             << " and " << j.first << "," << j.second << "  result: ";
    }
    bool ret=false;
    if(i.first<j.first) ret=true;
    else if(i.first>j.first) ret=false;
    else if(i.second<j.second) ret=true;
    else if(i.second>j.second) ret=false;
    if(DBG && ret==true) cerr << "TRUE" << endl;
    if(DBG && ret==false) cerr << "FALSE" << endl;
    return ret;
}

vector<pair<int, int> > getMoves(int a, int b){
    vector<pair<int, int> > moves;
    moves.emplace_back(pair<int, int>(a, b));
    moves.emplace_back(pair<int, int>(b, a));
    moves.emplace_back(pair<int, int>(-a, b));
    moves.emplace_back(pair<int, int>(b, -a));
    moves.emplace_back(pair<int, int>(a, -b));
    moves.emplace_back(pair<int, int>(-b, a));
    moves.emplace_back(pair<int, int>(-a, -b));
    moves.emplace_back(pair<int, int>(-b, -a));
    sort(moves.begin(), moves.end(), vector_pair_sort);
    vector<pair<int,int> >::iterator it=unique(moves.begin(), moves.end());
    moves.resize(distance(moves.begin(), it));
    
    if(DBG){
            cerr << "    getMoves of a=" << a << " and b=" << b << ":\n";
        for(int i=0; i<moves.size(); i++){
            cerr << "    a: " << moves[i].first << ", b: " << moves[i].second << "\n";
        }
            cerr << endl;
    }
    return moves;
}

vector<pair<int, int> > getValidMoves(int i, int j, vector<pair<int, int> > moves, int n){
    vector<pair<int, int> > validMoves;
    for(int k=0; k<moves.size(); k++){
        int new_i = i+moves[k].first;
        int new_j = j+moves[k].second;
        if(new_i>=0 && new_i<n && new_j>=0 && new_j<n)
            validMoves.emplace_back(pair<int,int>(new_i, new_j));
    }
    if(DBG){
            cerr << "       getValidMoves of a=" << i << " and b=" << j << ":\n";
        for(int k=0; k<validMoves.size(); k++){
            cerr << "       a: " << validMoves[k].first << ", b: " << validMoves[k].second << "\n";
        }
            cerr << endl;
    }
    return validMoves;
}

int traverse(vector<int> squares, vector<pair<int, int> > moves, int n, pair<int, int> cur, int depth){
    int ret=-1;
    if(DBG) cerr << "@depth: " << depth << ", cur i:" << cur.first << ", j:" << cur.second << endl;
    if(cur.first==n-1 && cur.second==n-1) return depth;
    if(depth>=record) return -1;
    squares[cur.first*n+cur.second]=1;
    vector<pair<int, int> > validMoves = getValidMoves(cur.first, cur.second, moves, n);
    for(int i=0; i<validMoves.size(); i++){
     if(squares[validMoves[i].first*n+validMoves[i].second]==0){
         int local_min = traverse(squares, moves, n, validMoves[i], depth+1);
         if(local_min!=-1){
             if(local_min<record) record=local_min;
             if(ret==-1 || local_min<ret) ret=local_min;
         }
     }
    }
    return ret;
}

int main(){
    int n;
    cin >> n;
    // your code goes here
    vector<int> moves(8);
    for(int i=0; i<n-1; i++){
        for(int j=0; j<n-1; j++){
            record=n*n;
            vector<int> squares(n*n,0);
            vector<pair<int, int> > moves=getMoves(i+1, j+1);
            int min=traverse(squares, moves, n, pair<int, int>(0,0), 0);
            cout << min << " ";
        }
        cout << endl;
    }
    
    return 0;
}