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


int main(){
    int n;
    cin >> n;
    // your code goes here
    int out[n-1][n-1],reach[n][n];
    int x,y,dead,cap,step,xo,yo;
    for(int i=1;i<n;i++) {
     for(int j=i;j<n;j++) {
       step=0;
       for(int ii=0;ii<n;ii++) {
         for(int jj=0;jj<n;jj++) {
            reach[ii][jj]=-1;
         }
        }
    
       reach[0][0]=0;
       cap=1;
       while(cap!=0) {
           cap=0;
           for(int ii=0;ii<n;ii++) {
             for(int jj=0;jj<n;jj++) {
               if(reach[ii][jj]==step) {
                if(ii+i<n&&jj+j<n&&reach[ii+i][jj+j]==-1) {
                    reach[ii+i][jj+j]=step+1;
                    cap++;
                  //  reach[jj+j][ii+i]=step+1;
                } 
                if(ii+j<n&&jj+i<n&&reach[ii+j][jj+i]==-1) {
                    reach[ii+j][jj+i]=step+1;
                    cap++;
                  //  reach[jj+i][ii+j]=step+1;
                } 
                if(ii+i<n&&jj-j>=0&&reach[ii+i][jj-j]==-1) {
                    reach[ii+i][jj-j]=step+1;
                    cap++;
                  //  reach[jj-j][ii+i]=step+1;
                } 
                if(ii+j<n&&jj-i>=0&&reach[ii+j][jj-i]==-1) {
                    reach[ii+j][jj-i]=step+1;
                    cap++;
                   // reach[jj-i][ii+j]=step+1;
                } 
                if(ii-i>=0&&jj+j<n&&reach[ii-i][jj+j]==-1) {
                    reach[ii-i][jj+j]=step+1;
                    cap++;
                  //  reach[jj+j][ii-i]=step+1;
                } 
                if(ii-j>=0&&jj+i<n&&reach[ii-j][jj+i]==-1) {
                    reach[ii-j][jj+i]=step+1;
                    cap++;
                  //  reach[jj+i][ii-j]=step+1;
                } 
                if(ii-i>=0&&jj-j>=0&&reach[ii-i][jj-j]==-1) {
                    reach[ii-i][jj-j]=step+1;
                    cap++;
                   // reach[jj-j][ii-i]=step+1;
                } 
                if(ii-j>=0&&jj-i>=0&&reach[ii-j][jj-i]==-1) {
                    reach[ii-j][jj-i]=step+1;
                    cap++;
                   // reach[jj-i][ii-j]=step+1;
                } 
                //cout<<x<<" "<<y<<" "<<step<<endl;
               }
             if(reach[n-1][n-1]!=-1) {
                out[i-1][j-1]=reach[n-1][n-1];
                out[j-1][i-1]=reach[n-1][n-1];    
                break;
            }
            
           }
             if(reach[n-1][n-1]!=-1) break;
         }
           if(cap==0) {
                out[i-1][j-1]=-1;
                out[j-1][i-1]=-1;
            }
           step++;
           
           if(reach[n-1][n-1]!=-1) break;
        }
      }
    }
    for(int i=0;i<n-1;i++) {
        for(int j=0;j<n-1;j++) {
            cout<<out[i][j];
            if(j!=n-2) cout<<" ";
        }
        cout<<endl;
    }
    return 0;
}