#include <iostream>

int fibi(int n)
{
	// Итерационный алгоритм
	int a = 1, b = 1;
	int c = 1;
	for (int i = 3; i <= n; i++)
	{
		c = a + b;
		a = b; b = c;
	}
	return c;
}

int fib(int n)
{
	if (n <= 2) return 1;
	else return fib(n - 1) + fib(n - 2);
}

double fact(int n)
{   
	static int m = 1;
	printf("%d ", m++);
	if (n == 0) return 1;
	else return n*fact(n - 1);
}

int main()
{
	printf("\n%10.0f\n", fact(6));
	printf("%d\n", fib(30));
	printf("%d\n", fibi(40));
}