def f(x):
    p = 1
    count = 0
    while p << 1 <= x:
        p <<= 1
        count += 1
    bits = 0
    while p:
        if p <= x:
            bits += count*(p >> 1) + x - p + 1
            x -= p
        p >>= 1
        count -= 1
    return bits


def ones(x):
    suma = 0
    while x:
        suma += x & 1
        x >>= 1
    return suma


def solve(n):
    first = 1
    right = 1
    while f(right) < n:
        right <<= 1
    while first <= right:
        s = (first + right) >> 1
        if f(s) < n:
            first = s + 1
        else:
            right = s - 1

    left = f(first) - n
    ans = [str(first)]
    last = first - 1
    for i in range(first - 1, 0, -1):
        if ones(i) <= left:
            left -= ones(i)
        else:
            ans.append(str(i))
        if not left:
            last = i - 1
            break

    print(len(ans) + last)
    print(" ".join(ans + [str(i) for i in range(last, 0, -1)]))


solve(int(input()))