1347 : Fibonacci

时间限制:1 Sec 内存限制:128 MiB
提交:277 答案正确:135

提交 状态 讨论区

题目描述

There are another kind of Fibonacci numbers: F(0) = 0, F(1) = 1, F(n) = F(n-1) + F(n-2) (n>=2).

输入

Input consists of a sequence of lines, each containing an integer n. (0 <= n < = 40).

输出

Print F(n).

样例输入

复制
2
5

样例输出

复制
1
5

提示


			

来源