import java.util.*;
//杨辉三角是二维数组的一个典型应用
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//输入打印几行
int n = sc.nextInt();
int[][] arr = new int[n][n];
for(int i = 0;i < n;i ++){
for(int j = 0;j < i+1;j++){
if(i==j||j==0){
arr[i][j] = 1;
}
else{
arr[i][j] = arr[i-1][j-1]+arr[i-1][j];
}
}
}
//打印输出
for(int m = 0;m <n; m ++){
for(int k = 0;k < m+1;k ++){
System.out.print(arr[m][k]+ "\t");
}
System.out.println();
}
}
}
