Skip to content
UPEEC

N-th Fibonacci Number

Easy#basics#loops· solved by 0 · time limit 2.0 s

The Fibonacci numbers are F0=0F_0 = 0, F1=1F_1 = 1 and Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2}. Print FnF_n.

Input

A single integer nn.

Output

FnF_n

Constraints

0≤n≤900 \le n \le 90

Sample 1

Input

10

Output

55

Sample 2

Input

1

Output

1

Sign in or join free to run and submit your solution.