#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int N = 2e7 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

mt19937_64 rng(time(0));

int n, m, k, mod;

int mul(int x, int y) {
  int res = 0;
  rep(i, 0, k - 1) if (x >> i & 1) {
    res ^= y << i;
  }
  drep(i, 30, k) if (res >> i & 1) {
    res ^= mod << i - k;
  }
  return res;
}

int f(int x) {
  int res = mul(mul(x, x), x);
  return (x << k) | res;
}

int main() {
  n = read(), m = sqrt(0.5 * n);
  for (k = 1; 1 << k < m; ++ k) ;
  while (true) {
    mod = (1 << k) + rng() % (1 << k);
    auto check = [&](int x) {
      for (int s = 2; s < 1 << k; ++ s) {
        int d = __lg(s), cur = x;
        drep(i, k, d) if (cur >> i & 1) {
          cur ^= s << i - d;
        }
        if (!cur) return false;
      }
      return true;
    } ;
    if (check(mod)) break;
  }
  printf("%d\n", m);
  rep(i, 0, m - 1) printf("%d%c", f(i) ^ 1, " \n"[i == m]);
  return 0;
}