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
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

// #define ordered_set                                                            \
//   tree<PII, null_type, less<PII>, rb_tree_tag,                                 \
//        tree_order_statistics_node_update>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<ld, ld> PLD;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VII> VVII;
typedef vector<PLL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<string> VS;

template <class T, class G>
ostream &operator<<(ostream &os, const pair<T, G> &para) {
  os << para.first << " " << para.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  for (const T &el : vec)
    os << el << " ";
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &vec) {
  for (const T &el : vec)
    os << el << " ";
  return os;
}

#define REP(i, j) for (int i = 0; i < (j); i++)
#define REP1(i, j) for (int i = 1; i < (j); i++)
#define FOREACH(el, n) for (auto &el : n)
#define pb push_back
#define pf push_front
#define st first
#define nd second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define get_unique(x) x.erase(unique(all(x)), x.end());
#define sp ' '
#define ent '\n'

// template <class T> void print_case(int i, T &x) {
//   cout << "Case #" << i << ": " << x << ent;
// }
// void prep() {}

const int MAXN = 1e6;
int pref[MAXN];

void TEST(int testcase_i) {
  for (int i = 1; i < MAXN; ++i)
    pref[i] = pref[i - 1] + __builtin_popcount(i);

  int n;
  cin >> n;

  int maxi_ptr = MAXN - 1;
  VI ans;
  while (maxi_ptr--) {
    if (pref[maxi_ptr] < n) {
      ans.pb(maxi_ptr + 1);
      n -= __builtin_popcount(maxi_ptr + 1);
    }
  }
  cout << ans.size() << ent << ans;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);

  // cout << setprecision(16) << fixed;

  // srand(time(NULL));

  // freopen("sorting.in", "r", stdin);
  // freopen("sorting.out", "w", stdout);

  // prep();

  int t = 1;
  // cin >> t;
  REP(i, t) {
    TEST(i);
  }

  return 0;
}