2.3 Binary Numbers （二 进 制 数）

                                 2.3  Binary Numbers 

2.3.1 时空限制

         Time limit: 1 Seconds Memory limit: 32768K 

2.3.2 题目内容

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

Example 

         The positions of 1’s in the binary representation of 13 are 0, 2, 3. 

Task 

Write a program which for each data set: reads a positive integer n, computes the positions of 1’s in the binary representation of n, writes the result. 

Input 

The first line of the input contains exactly one positive integer d equal to the number of data sets, 1≤d ≤10. The data sets follow. Each data set consists of exactly one line containing exactly one integer n, 1≤n ≤106

O