int Fibonacci_1lanDeQuy(int n)
{
	if (n == 0)
		return 1;
	else if (n == 1)
		return 1;
	else
	{
		static int n0 = 0, n1 = 1, n2;
		if (n > 0)
		{
			n2 = n0 + n1;
			n0 = n1;
			n1 = n2;
			Fibonacci_1lanDeQuy(n - 1);
		}
		if (n == 2)
			return n2;
	}
}