System Fibonacci
Very easy
Execution time limit is 1 second
Runtime memory usage limit is 64 megabytes
As is known, positional number system based on the Fibonacci numbers is the alphabet {0, 1}, and the basis - the sequence of Fibonacci numbers 1, 2, 3, 5, ..., ie Fibonacci sequence, starting with F(2).
Our task - to translate a given non-negative decimal number N in the Fibonacci system. The result should be obtained as a string without leading zeros and without the adjacent ones (the so-called expanded form.)
Input
The only line of input contains the number N (1 ≤ N ≤ 2^62).
Output
The output file is the only string containing the response to the problem.
Examples
Input #1
Answer #1
Submissions 285
Acceptance rate 43%