#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int table[n][n] = {0};
table[0][0] = 1;
vector<set<int>> columns(n);
vector<set<int>> rows(n);
/*
set<int> full;
for(int i = 1; i <= n; i++){
full.insert(i);
}*/
/*
set<int> dummy;
columns.push_back(dummy);
rows.push_back(dummy);*/
for(int x = 0; x < n; x++){
table[0][x] = x+1;
set<int> temp;
temp.insert(x+1);
columns[x] = temp;
//cout << "add x " << (x+1) << endl;
}
for(int y = 0; y < n; y++){
table[y][0] = y+1;
set<int> temp;
temp.insert(y+1);
rows[y] = temp;
// cout << "add y " << (y+1) << endl;
}
/*
cout << "columns: " << endl;
for(set<int> setti : columns){
cout << "start" << endl;
for(int i : setti){
cout << i << endl;
}
cout << "end" << endl;
}
cout << "rows: " << endl;
for(set<int> setti : rows){
cout << "start" << endl;
for(int i : setti){
cout << i << endl;
}
cout << "end" << endl;
}
*/
for(int l = 1; l < n; l++){
for(int x = l; x < n; x++){
set<int> col = columns[x];
set<int> row = rows[l];
for(int i = 1; i <= 100; i++){
if(col.find(i) == col.end() && row.find(i) == row.end()){
rows[l].insert(i);
columns[x].insert(i);
table[l][x] = i;
break;
}
}
}
for(int y = l+1; y < n; y++){
set<int> col = columns[l];
set<int> row = rows[y];
for(int i = 1; i <= 100; i++){
if(col.find(i) == col.end() && row.find(i) == row.end()){
rows[y].insert(i);
columns[l].insert(i);
table[y][l] = i;
break;
}
}
}
}
/*
cout << "columns: " << endl;
for(set<int> setti : columns){
cout << "start" << endl;
for(int i : setti){
cout << i << endl;
}
cout << "end" << endl;
}
cout << "rows: " << endl;
for(set<int> setti : rows){
cout << "start" << endl;
for(int i : setti){
cout << i << endl;
}
cout << "end" << endl;
}
*/
for(int y = 0; y < n; y++){
for(int x = 0; x < n; x++){
cout << table[y][x] << " ";
}
cout << endl;
}
}
