import java.util.Scanner;
public class 杨辉三角 {
public static void main(String[] args) {
Scanner is_scanner=new Scanner(System.in);
System.out.println("请输入行数");
int m=is_scanner.nextInt();
int arr[][]=new int[m][];
for(int i=0;i<2;i++){
arr[i]=new int[i+1];
for(int j=0;j<arr[i].length;j++){
arr[i][j]=1;
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
for(int i=2;i<m;i++){
arr[i]=new int[i+1];
for(int j=0;j<arr[i].length;j++){
if(j==0||j==i){
arr[i][j]=1;
}else{
arr[i][j]=arr[i-1][j]+arr[i-1][j-1];
}
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}