Fibonacci Again!#1469
"Why bother with subroutines when you can type fast?"
Vaughn Rokosz
In mathematics, the Fibonacci numbers are the numbers in the following sequence: , , , , , , , , , , … . By definition, the first two Fibonacci numbers are and , and each remaining number is the sum of the previous two. In mathematical terms, the sequence F_n of Fibonacci numbers is defined by the recurrence relation F_{n} = F_{n-1} + F_{n-2} with seed values F_0 = 0 and F_1 = 1.
Given the index of a Fibonacci number, calculate the value F_i.
The input consists of several lines. Each line contains a single integer (0 \leq i < 1000), which is the index of a Fibonacci number. Read input until the end of file.
For each line of input, output the corresponding value F_i on a separate line.
Example 1