#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;


int main(){
    int n;
    cin >> n;
    for(int i = 1; i < n; i++){
        for (int j = 1; j < n; j++){
            if(i == n-1 && j == n-1){
                cout<<1<<" ";
                break;
            }   
            int min = -1;
            int c[3] = {0,0,0};
            if((n-1) % (i+j) == 0){ 
                c[0] = 2 * (n-1) / (i+j);
                min = c[0];
            }
            if ((n-1) % i == 0 &&  ((n-1)/i) % 2 == 0){ 
                c[1] = 2 * ((n-1)/i);
                if (c[1] < min && min != -1) min = c[1];
                else if(min == -1) min = c[1];
            }
            if ((n-1) % j == 0 && ((n-1)/j) % 2 == 0){
                c[2] = 2 * ((n-1)/j);
                if(c[2] < min && min != -1) min = c[2];
                else if(min == -1) min = c[2];
            }
            cout << min << " ";
        }
        cout<<endl;
    }
    return 0;
}