题目1073：杨辉三角形

import java.util.Scanner;
import java.io.FileReader;
import java.io.BufferedReader;
import java.io.IOException;

class Main
{
	private final static boolean DEBUG = false;
	private int[] f;
	
	private void init(int n)
	{
		f = new int[n];
		f[0] = f[1] = 1;
	}
	
	private void dfs(int cur)
	{
		if (cur == 2) {
			boolean flag = true;
			for (int i = 0; i < cur; i++) {
				if (flag) flag = false;
				else System.out.print(" ");
				System.out.print(f[i]);
			}
			return;
		} else {
			dfs(cur - 1);
			f[cur - 1] = 1;
			for (int i = cur - 2; i >= 1; i--) {
				f[i] = f[i - 1] + f[i];
			}
			System.out.println();
			
			boolean flag = true;
			for (int i = 0; i < cur; i++) {
				if (flag) flag = false;
				else System.out.print(" ");
				System.out.print(f[i]);
			}
		}
	}
	
	public void solve(int n)
	{
		init(n);
		dfs(n);
	}
	
	public static void main(String[] args) throws IOException 
	{
		Scanner cin;
		int n;
		
		if (DEBUG) {
			cin = new Scanner(new BufferedReader(new FileReader("d:\\OJ\\uva_in.txt")));
		} else {
			cin = new Scanner(System.in);
		}
		
		while (cin.hasNext()) {
			n = cin.nextInt();
			Main solver = new Main();
			solver.solve(n);
			System.out.println();
		}
	}
}