杨辉三角

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[][] a = new int[n+1][n+1];
		a[1][1] = 1;
		for(int i = 2 ; i <= n ; i++){
			for(int j = 1 ; 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++ ){
				if(a[i][j] != 0){
					System.out.print(a[i][j]+" ");
				}
			}
			System.out.println();
		}
	}
	
	
}