#449. Fibonacci: how many Fibonacci numbers are not greater than N (in the order 1, 1, 2, 3, 5, ..., counting both 1s)
The Fibonacci sequence: 1, 1, 2, 3, 5, 8, ... Find: **how many Fibonacci numbers are not greater than N (in the order 1, 1, 2, 3, 5, ..., counting both 1s)**.
### Input
One integer N (1 ≤ N ≤ 10¹⁸).
### Output
One integer.
Examples
Input
23133
Output
22
Input
5
Output
5
💡 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.