package Challenges;
import java.util.Scanner;
public class PascalTraingle {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
System.out.println("hekloji");
int rows=1;
int nst =1;
while(rows<=n)
{
for(int cst=1;cst<=nst;cst++)
{
int var=fact(rows)/(fact(cst) * fact(rows-cst));
System.out.print(var +"\t");
}
//preparation
System.out.println();
nst++;
rows++;
}
}
public static int fact(int n )
{
int factorial;
for(factorial = 1; factorial < n;n--)
{
factorial = factorial*n;
}
return factorial;
}
}