AC
import java.util.Scanner;
public class 杨辉三角1 {
public static void main(String []args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int num[][] = new int [35][35];
for(int i = 1; i <= n; i++) {
for(int k = 1; k <= i; k++) {
if(k==1||k==i)
num[i][k]=1;
else
num[i][k]=num[i-1][k-1]+num[i-1][k];
System.out.print(num[i][k]+" ");
}
System.out.println();
}
in.close();
}
}