#include <iostream>

using namespace std;

int n,a[101][101],i,j;
int main()
{cin>>n;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++) //cu 0, exact ce e deasupra diagonolei principale
a[i][j]=0;

for(j=1;j<=n;j++)
a[n][j]=j; // ultimul rand cu 1,2,3,4

for(i=n-1;i>=1;i--)
for(j=1;j<=i;j++)
a[i][j]=a[i+1][j-1]+a[i+1][j]+a[i+1][j+1]; //sub diagonala principala
plus diagonala principala, a[i+1][j-1]=0/nu exista

for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
{cout<<a[i][j]<<' ';}
cout<<endl;}

return 0;
}