#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,a[40][40];
void dfs(int dep,int x,int y)
{
if(dep>n*n)return;
a[x][y]=dep;
if(a[(x-1+n)%n][(y+1)%n])
dfs(dep+1,(x+1)%n,y);
else
dfs(dep+1,(x-1+n)%n,(y+1)%n);
}
signed main()
{
cin>>n;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
cout<<a[i][j]<<' ';
cout<<endl;
}
return 0;
}