Fibonacci

Time Limit: 1000ms
Memory Limit: 32768KB
64-bit integer IO format: %lld      Java class name: Main

Description

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.

Input

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

Output

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

Sample Input

1

Sample Output

1

Author

Admin
Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .