## Description

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. 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.

## Output

The output should consists of exactly d lines, one line for each data set. Line i, 1 ≤ i ≤ d, should contain increasing sequence of integers separated by single spaces – the positions of 1's in the binary representation of the i-th input number. Do not output any spaces in the end of a line.

```1
13```

`0 2 3`

## HINT

/一道关于二进制位处理的基础题。我用数的奇偶性来判断最低位是0还是1，加之位运算实现程序。下面是我的代码，能力所限，不足之处欢迎指点。/
#include <stdio.h>
int main()
{
int a[10],i,j,k=0,p=0,n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
k=0;
p=0;
for(j=0;j<sizeof(int)*8;j++)
{
if(a[i]%2!=0){
if(p==0)
printf("%d",k);
else
printf(" %d",k);
p++;
}
a[i]=a[i]>>1;
k++;
}
printf("\n");
}
return 0;
}