Black box#11381

Black box

1 second

128 megabytes

Very easy

Each of $n$ identical balls was labeled with one of the numbers $1$ , $2$ , $4$ , $8$ , $\dots$ , $2^{n - 1}$ 2^{n-1}. Having checked that all the numbers on the balls were different, the balls were placed in a black box. Petya took out several balls, found the sum of the numbers on them and got the result $m$ . Print the numbers on the balls that Petya took out.

Input

One integer $m$ ( $1 \leq m \leq 1 0^{9}$ 1 \leq m \leq 10^9).

Output

Print the balls numbers in increasing order.

Examples

Example 1

Loading

2^{n - 1}

1 \leq m \leq 1 0^{9}