|
Time |
Memory |
| Case 1 |
10 sec |
32 MB |
Description
Given N, calculate the N'th Fibonacci number.
Input
For each case a line, there is a positive integer N. ( 1 <= N <= 1000 )
There are at most 20 cases.
Output
For each case a line, print the N'th Fibonacci number.
Tags