Fibonnacis(int a)
{
	if(a <= 2)
	 return 1;
	else
	 return Fibonnacis(a-1) + Fibonnacis(a-2);
}

Pascal1(int a,int b)
{
	if(a < 0 || b < 0 || b > a)
	 return main(); //********FIX WITH LOOP
	long c = 1;
	for(int i = 1; i <=b;i++)
	 c = c * a/i;
	return a;
}

Factorial1(int a)
{
	int answer = 1;
	while(a>1)
	 answer *= a--;
	return answer;
}