/*
2032 楊輝三角
Time Limit : 1000 ms  Memory Limit : 32768 K  Output Limit : 256 K

GUN C++
*/
#include <iostream>
#include <string>
using namespace std;

const int Max=50;

int main()
{
    int n,ca,cb;
    int num1[Max],num2[Max];
    
    while(cin>>n)
    {
        memset(num1,0,sizeof(num1));
        for(ca=1;ca<=n;ca++)
        {
            num1[0]=1;
            cout<<1;
            for(cb=1;cb<ca;cb++)
            {
                num2[cb]=num1[cb-1]+num1[cb];
                cout<<' '<<num2[cb];
            }
            cout<<endl;
            for(cb=0;cb<ca;cb++)
                num1[cb]=num2[cb];
        }
		cout<<endl;
    }
    return 0;
}