//杨辉三角
#include<iostream>
using namespace std;
int main()
{
int a[15][15], n;
cin >> n;
for (int i = 0;i < n;i++)
a[1][1] = 1;
a[2][1] = a[2][2] = 1;
for (int i = 3;i <= n;i++)
{
//边上的1
a[i][1] = a[i][i] = 1;
for (int j = 2;j <= i - 1;j++)
{
//规律
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
}
}
for (int i = 1;i <= n;i++)
{
for (int j = 1;j <=i;j++)
{
cout << a[i][j] << " ";
}
cout << endl;
}
return 0;
}