1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <math.h>
#include <iomanip>
#include <set>
#include <list>
#include <queue>
#include <map>
#include <vector>
#include <stack>

constexpr int N = 1e6 + 7;

int t[N];
int pot[N];
long long pref[N];
std::vector<int>vec;

int main()
{
	std::ios_base::sync_with_stdio(0);
	std::cin.tie(0);

	int n;
	std::cin >> n;
	int w = 0;
	long long p = 1;
	while (p <= 1e7)
	{
		pot[w] = p;
		++w;
		p *= 2;
	}

	for (int i = 1; i <= n + 2; ++i)
	{
		int x = i;
		for (int j = w - 1; j >= 0; --j)
		{

			if (x - pot[j] >= 0)
			{
				++t[i];
				x -= pot[j];
			}
		}
	}
	for (int i = 1; i <= n + 2; ++i)
	{
		pref[i] += pref[i - 1] + t[i];
	}

	int pocz = 0;
	int kon = n;
	while ((kon - pocz) > 1)
	{
		int sr = (kon + pocz) / 2;
		if (pref[sr] < n)
		{
			pocz = sr;
		}
		else
		{
			kon = sr;
		}
	}

	if (pref[kon] == n)
	{
		std::cout << kon<<"\n";
		for (int i = kon; i >= 1; --i)
		{
			std::cout << i << ' ';
		}
		return 0;
	}

	int x = pref[kon] - n;
	bool bul = 0;
	vec.push_back(kon);
	for (int i = kon - 1; i >= 1; --i)
	{
		if (bul == 0 && t[i] == x)
		{
			bul = 1;
			continue;
		}
		vec.push_back(i);
	}
	std::cout << vec.size() << "\n";
	for (int i : vec)
	{
		std::cout << i << ' ';
	}
}