Zeckendorf Representation

Given a positive integer \(n\) (where \(1 \le n \le 10^{18}\)), decompose \(n\) into a sum of distinct, non-consecutive Fibonacci numbers according to Zeckendorf's theorem. The Fibonacci sequence to be considered starts with \(1, 2, 3, 5, \dots\). Your task is to output the Fibonacci numbers used in the representation in descending order.

Note: It is guaranteed that such a unique representation exists for every positive integer.

For example, for \(n=28\), the Zeckendorf representation is \(21 + 5 + 2\); for \(n=100\), it is \(89 + 8 + 3\>.

inputFormat

The input consists of a single line containing one positive integer \(n\).

outputFormat

Output the Zeckendorf representation of \(n\) as a sequence of Fibonacci numbers in descending order, separated by a single space.

## sample

28

21 5 2

</p>