As is known, positional number system based on the Fibonacci numbers is the alphabet \textbf{\{0, 1\}}, and the basis - the sequence of Fibonacci numbers \textbf{1}, \textbf{2}, \textbf{3}, \textbf{5}, ..., ie Fibonacci sequence, starting with \textbf{F(2)}. Our task - to translate a given non-negative decimal number \textbf{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.) \InputFile The only line of input contains the number \textbf{N} (\textbf{1} ≤ \textbf{N} ≤ \textbf{2^62}). \OutputFile The output file is the only string containing the response to the problem.