//从对角线开始，分别从行和列，1-2-3-4-5输出
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    int a[101][101];
    while(cin>>n,n){
        for(int i=0;i<n;i++){
            a[i][i]=1;
            int k;
            for(int j=i+1,k=2;j<n;j++,k++)a[i][j]=k;
            for(int j=i+1,k=2;j<n;j++,k++)a[j][i]=k;    
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
            cout<<a[i][j]<<" "; 
    }cout<<endl;}
    cout<<endl;}
    return 0;
}

//转载：曼哈顿距离
#include <iostream>
#include <algorithm>
using namespace std;

int n;
int main()
{
    while (cin >> n)
    {
        for (int i = 0; i < n; i ++ )
        {
            for (int j = 0; j < n; j ++ )
                cout << abs(i - j) + 1 << ' ';  // 规律

            cout << endl;
        }

        if (n) cout << endl;
    }

    return 0;
}