ZOJ Problem Set - 1828
A Fibonacci sequence is calculated by adding the previous two members of the sequence, with the first two members being both 1.
f(1) = 1, f(2) = 1, f(n > 2) = f(n - 1) + f(n - 2)
Your task is to take a number as input, and print that Fibonacci number.
No generated Fibonacci number in excess of 1000 digits will be in the test
data, i.e. f(20) = 6765 has 4 digits.
Source: University of Waterloo Local Contest 1996.10.05