Limits 1s, 512 MB

Given an integer NN, print the NN-th Fibonacci number.

A Fibonacci series is a series of numbers in which each number is the sum of the two numbers preceding it. For this problem, you can assume that the first two numbers in the series are 1 and 1.

Below you can see the first few numbers of the series:

1, 1, 2, 3, 5, 8, ...

Input

The input will contain an integer NN (0<N<500 < N < 50).

Output

Print the NN-th Fibonacci number.

Sample

InputOutput
3
2

Submit

Login to submit.

Contributors

Statistics

95% Solution Ratio
ShahedHossenEarliest, Nov '18
ShahedHossenFastest, 0.0s
CCS_RUSHIKONLightest, 0 B
lydxn_cgShortest, 29B
Toph uses cookies. By continuing you agree to our Cookie Policy.