20360번 - Binary numbers 다국어

Given a positive integer n, find the positions of all 1’s in its binary representation. The position of the least significant bit is 0.

Write a program that:

• reads a positive integer n from the standard input,
• computes the positions of 1’s in the binary representation of n,
• writes the result to the standard output.

The first and only line of the input contains exactly one integer n, 1 ≤ n ≤ 10⁶.

The output should contain increasing sequence of integers separated by single spaces — the positions of 1’s in the binary representation of the input number.