// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
unsigned long long seed = std::chrono::system_clock::now().time_since_epoch().count();
std::mt19937_64 Rand(seed);
using mint = unsigned long long;
int n, k;
mint f;
mint mod(mint a, mint b)
{
    int lena = 64 - __builtin_clzll(a), lenb = 64 - __builtin_clzll(b);
    for (int i = lena; i-- >= lenb;)
        if (a >> i & 1)
            a ^= b << (i + 1 - lenb);
    return a;
}
mint mul(mint a, mint b)
{
    mint res = 0;
    while (b)
    {
        if (b & 1)
            res ^= a;
        b >>= 1;
        a <<= 1;
        if (a >> k & 1)
            a ^= f;
    }
    return res;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n;
    ++n;
    while (2 << (k << 1) < n)
        ++k;
    do
    {
        f = 1 << k | (Rand() % (1 << k));
        for (int i = 2; i < 1 << k; ++i)
            if (mod(f, i) == 0)
            {
                f = 0;
                break;
            }
    } while (!f);
    std::vector<mint> ans;
    for (int i = 0; i != 1 << k && int(i << k ^ mul(mul(i, i), i) ^ 1) < n; ++i)
        ans.push_back(i << k ^ mul(mul(i, i), i) ^ 1);
    std::cout << ans.size() << std::endl;
    for (auto i : ans)
        std::cout << i << " \n"[i == ans.back()];
    return 0;
}