#描述#
Given a positive integer n,print the positions of all 1’s in its binary representation.<br>
Example<br>
The positions of 1’s in the binary representation of 13 are 0,2,3.

#格式#
##输入格式##
The input consists of multiple test cases.Every test case contain a integer n(0<n<=10^9).

##输出格式##
For every input,you should output a line.The line should contain increasing sequence of integers separated by single spaces—the positions of 1’s in the binary representation of the input number.

#样例1#
##样例输入1##

13
5

##样例输出1##

0 2 3
0 2

#限制#
1000ms
32768KB

#提示#

#来源#