#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f[30][30][30];
ll n;
int main()
{
while (~scanf("%lld",&n))
{
f[0][1][1]=1;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=i+1; j++)
{
for (int k=1; k<=j; k++)
{
f[i][j][k]=f[i-1][j-1][k-1]+f[i-1][j-1][k]+f[i-1][j][k];
}
}
}
for (int i=1; i<=n+1; i++)
{
for (int j=1; j<=i; j++)
{
printf("%lld",f[n][i][j]);
if (j!=i)
printf(" ");
else
printf("\n");
}
}
}
}