1416: Fibonacci

The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55...} are defined by the recurrence:
F0=0 F1=1 Fn=Fn-1+Fn-2,n>=2
Write a program to calculate the Fibonacci Numbers.


贴心翻译：斐波那契数列{0,1,1,2,3,5,8,13,21,34,55...}由以下递归公式定义：
F0=0, F1=1, Fn=Fn-1+Fn-2,n>=2
编写一个程序来计算斐波那契数列。

Each case contains a number n and you are expected to calculate Fn.(0<=n<=30) 。


贴心翻译：每组数据都包含一个数字n，你需要计算Fn（0≤n≤30）。

For each case, print a number Fn on a separate line,which means the nth Fibonacci Number.


贴心翻译：对于每组数据，在单独一行上输出一个数字Fn，表示第n个斐波那契数。

1

1