codeforces Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) A.Slime Combining

A. Slime Combining

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Sample test(s)

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

1. 4

//总的来说现在的水平每次都是水掉前一辆体，，这题找的规律。。f(n) = 1 + f(n - 1) + ... f(1)

//然后输入N,找到N < f(n), 输出n - 1, 再n -= f(n - 1), 反复如此直到n为零。

//例如n = 6；f(1) = 1; f(2) = 2; f(3) = 4; f(4) = 8;

//6 < f(4) = 8

//输出3; 6 - f(4 - 1) = 2;

//2 < f(3) = 4;

//输出2; 2 - f(3 - 1) = 0;

//END;

//嘛，，感觉这样做蛮复杂的，不知道有没有其他方法。。以后慢慢想吧。。

//以下代码。。虽然CF可以过，，但是以后还要看看输出能不能做一下最后换行。

#include<stdio.h>
int a[100000];
int main()
{
int n;
int i, j, flag;
scanf("%d", &n);
a[0] = 0;
for(i = 1; i <= 18; i++)
{
a[i] = 0;
for(j = i - 1; j >= 1; j--)
a[i] += a[j];
a[i] += 1;
}
while(n > 0)
{
for(i = 0; i <= 18; i++)
if(a[i] > n)
break;
printf("%d ", i - 1);
n -= a[i - 1];
}
return 0;
}