Leaf Size Fibonacci

On day (n), a new leaf is produced with a size that follows the Fibonacci sequence. More formally, the leaf sizes satisfy the recurrence (F(1)=1,; F(2)=1,) and for (n \ge 3), (F(n)=F(n-1)+F(n-2)). Given an integer (n), compute (F(n)), which represents the size of the last leaf produced on the (n)th day.

inputFormat

Input consists of a single line with a single integer (n) (where (1 \le n \le 10^5)).

outputFormat

Output the size of the last leaf produced on the (n)th day.## sample

1

1