#418. Fibonacci: the n-th Fibonacci number (F₁ = F₂ = 1)
The Fibonacci sequence: 1, 1, 2, 3, 5, 8, ... Find: **the n-th Fibonacci number (F₁ = F₂ = 1)**.
### Input
One integer n (1 ≤ n ≤ 90).
### Output
One integer.
Examples
Input
75
Output
2111485077978050
Input
65
Output
17167680177565
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.