#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef pair<int, int> PII;
using ll = long long;
using ULL = unsigned long long;
const int N = 1e7 + 5;

int n;
int a[40][40];
inline void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        a[i][i] = 1;
        a[i][1] = 1;
        for (int j = 2; j <= i; j++) {
            a[i][j] = a[i-1][j]+a[i-1][j-1];
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            cout << a[i][j] << ' '; 
        cout << endl;
    }        
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    //int _; cin >> _;
    while (_--) solve();
    return 0;
}

#include<bits/stdc++.h> using namespace std; const int N=35; int a[N][N]; int main() { int i,j,n; cin>>n; a[0][0]=1; for(i=0;i<n;i++){ for(j=0;j<=i;j++){ if(j0||ji){ a[i][j]=1; } else{ a[i][j]=a[i-1][j-1]+a[i-1][j]; } } } for(i=0;i<n;i++){ for(j=0;j<=i;j++){ cout<<a[i][j]<<" "; } cout<<endl; } return 0; }