Fibonacci Number

Compute the (N)-th Fibonacci number. The Fibonacci sequence is defined as follows: (F(0) = 0), (F(1) = 1), and for (n \geq 2), (F(n) = F(n-1) + F(n-2)). Given an integer (N), output the (N)-th Fibonacci number.

inputFormat

The input contains a single integer (N) ((0 \le N \le 90)), representing the position in the Fibonacci sequence. The bound ensures that the result fits within a 64-bit integer.

outputFormat

Output a single integer -- the (N)-th Fibonacci number.## sample

0

0