#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>
#include<bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define mpa make_pair
using namespace std;
typedef long long LL;
int dxtemp[8];
int dytemp[8];




 

     
bool valid(int x, int y, int N, int M) {
    if(x <= 0 || y <= 0 || x > N || y > M)
            return false;
    return true;
}
 
int bfs(pair<int, int> p1, pair<int, int> p2, pair<int, int> p3) {
     
    int N = p3.ff;
    int M = p3.ss;
    queue<pair<pair<int, int>, int> > Que;
    map<pair<int, int>, bool> Vis;
         
    Que.push(mpa(p1, 0));
 
    while(!Que.empty()) {
     
        pair<pair<int, int>, int> temp = Que.front();
        Que.pop();
 
        if(temp.ff.ff == p2.ff && temp.ff.ss == p2.ss)
                return temp.ss;
        int x = temp.ff.ff;
        int y = temp.ff.ss;
        int dis = temp.ss + 1;
 
 
        if(Vis.count(mpa(x, y)))
            continue;
        Vis[mpa(x, y)] = true;
 
        for(int i = 0; i <= 7; ++i) {
            
            int x1 = x + dxtemp[i];
            int y1 = y + dytemp[i];
            if(valid(x1, y1, N, M))
            Que.push(mpa(mpa(x1, y1), dis));
        }
 
    }
 
    return -1;
}



void printarray (int arg[], int length) {
  for (int n=0; n<length; ++n)
    cout << arg[n] << ' ';
  cout << '\n';
}
     
int solve(int N, int M, int x1, int y1, int x2, int y2) {
 
    pair<int, int> p1;
    p1.ff = x1;
    p1.ss = y1;
 
    pair<int, int> p2;
    p2.ff = x2;
    p2.ss = y2;
 
    pair<int, int> p3;
    p3.ff = N;
    p3.ss = M;
 
    int ans = bfs(p1, p2, p3);
    return ans;
}

int main(){

    int n;
    cin >> n;
    for(int i1=1;i1<n;i1++){
        for (int j1=1;j1<n;j1++){
            
            
            dxtemp[0]=j1;
            dxtemp[1]=j1;
            dxtemp[2]=-j1;
            dxtemp[3]=-j1;
            dxtemp[4]=i1;
            dxtemp[5]=i1;
            dxtemp[6]=-i1;
            dxtemp[7]=-i1;
            
            
            dytemp[0]=-i1;
            dytemp[1]=i1;
            dytemp[2]=i1;
            dytemp[3]=-i1;
            dytemp[4]=j1;
            dytemp[5]=-j1;
            dytemp[6]=j1;
            dytemp[7]=-j1;
            
            
            printf("%d ",solve(n, n, 1, 1, n, n));
        }printf("\n");
    }
    
 return 0;   
}
  
 
/*int main() {
     
    cout << solve(8, 8, 1, 1, 8, 8) << endl;
    return 0;
}*/