#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 10;
const int M = 100000 + 10;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t, n, m, k, p, l, r, u, v;
int ans, cnt, flag, temp, sum;
int a[N], b[N];
char str;
struct node {};
int main() {
  scanf("%d", &n);
  t = n;
  while (t) {
    sum += t % 2;
    a[++ans] = t % 2;
    t /= 2;
  }
  if (ans == sum) {
    cout << 0 << "\n";
    return 0;
  }
  flag = 1;
  cnt = 0;
  while (1) {
    flag = 0;
    for (int i = ans; i >= 1; i--) {
      if (!a[i]) {
        flag = 1;
        b[++cnt] = i;
        break;
      }
    }
    if (flag) {
      for (int i = b[cnt]; i >= 1; i--) {
        a[i] ^= 1;
      }
    } else {
      break;
    }
    flag = 0;
    for (int i = ans; i >= 1; i--) {
      if (!a[i]) {
        flag = 1;
      }
    }
    if (flag) {
      a[1] += 1;
      cnt++;
      for (int i = 2; i <= ans; i++) {
        a[i] = a[i] + a[i - 1] / 2;
        a[i - 1] %= 2;
      }
    } else {
      break;
    }
  }
  cout << cnt << "\n";
  for (int i = 1; i <= cnt; i += 2) {
    cout << b[i] << " ";
  }
  return 0;
}
