Problem1344--Fibonacci Numbers

### 1344: Fibonacci Numbers

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

#### Description

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.

100

#### Output

354224848179261915075

#### Sample Input Copy

100

#### Sample Output Copy

354224848179261915075

#### HINT

No generated fibonacci number in excess of 1000 digits will be in the test data, i.e. f (20) = 6765
has 4 digits.