斐波那契数列

//斐波那契数列
 //1,函数递归
int  Fib(int n) {
	if (n < 2)
		return 1;
	if (n >= 2)
		return  Fib(n - 1) + Fib(n - 2);
}

//缺点:计算太慢了
int main() {
	int a;
	scanf("%d", &a);
	int b = Fib(a);
	printf("%d", b);
	return 0;
}


//2.迭代
int ret(int n) {
	int a = 1;
	int b = 1;
	int c = 1;

	if (n <= 2)
		return c;
	while (n > 2) {
		c = a + b;
		a = b;
		b = c;
		n--;
	}
	return c;

}



int main() {
	int m;
	scanf("%d", &m);
	int r = ret(m);
	printf("%d", r);
	return 0;
}