Slime Combining

Your friend recently gave you some slimes for your birthday. You have n slimes all initially with value 1.

You are going to play a game with these slimes. Initially, you put a single slime by itself in a row. Then, you will add the other n - 1 slimes one by one. When you add a slime, you place it at the right of all already placed slimes. Then, while the last two slimes in the row have the same value v, you combine them together to create a slime with value v + 1.

You would like to see what the final state of the row is after you've added all n slimes. Please print the values of the slimes in the row from left to right.

Input

The first line of the input will contain a single integer, n (1 ≤ n ≤ 100 000).

Output

Output a single line with k integers, where k is the number of slimes in the row after you've finished the procedure described in the problem statement. The i-th of these numbers should be the value of the i-th slime from the left.

Example

Input

1

Output

1

Input

2

Output

2

Input

3

Output

2 1

Input

8

Output

4

Note

In the first sample, we only have a single slime with value 1. The final state of the board is just a single slime with value 1.

In the second sample, we perform the following steps:

Initially we place a single slime in a row by itself. Thus, row is initially 1.

Then, we will add another slime. The row is now 1 1. Since two rightmost slimes have the same values, we should replace these slimes with one with value 2. Thus, the final state of the board is 2.

In the third sample, after adding the first two slimes, our row is 2. After adding one more slime, the row becomes 2 1.

In the last sample, the steps look as follows:

1. 1
2. 2
3. 2 1
4. 3
5. 3 1
6. 3 2
7. 3 2 1
8. 4

题意：将n个slimes依次放在一排，每个slimes的初始值为1，当最后两个的值相等

则将最后两个合并在一起，新的slimes的值为原值+1，求将N个slimes放完后剩余slimes

每个所代表的值

思路：观察发现其实最后的答案为n的二进制中为1的数字（好像没说明白，大家看下边的例子吧~~~）

如：

n->      7： 4321    8:4321     3:4321      6:4321

二进制        0111       1000        0011         0110

#include<stdio.h>
#include<string>
#include<string.h>
#include<iostream>
using namespace std;
int arr[20];
int solve(int x){ //将x转化成二进制数 
	int i=1;
	while(x){
		arr[i++]=x%2;
		x/=2;
	}
	return i;
} 
int main(){
    int n;
	while(cin>>n){
		memset(arr,0,sizeof(arr));
		int k=solve(n);
		int flag=0;
		for(int i=k-1;i>=1;i--){
			if(arr[i]){
				if(!flag){
				  printf("%d",i);
				  flag=1;	
				}
				else printf(" %d",i);
			}
		} 
		puts("");
	}
	return 0;
}