MOD = 998244353

def is_power_of_two(n):
    return (n & (n - 1)) == 0 and n != 0

def find_k(M_plus_1):
    if M_plus_1 == 0:
        return 0
    return (M_plus_1).bit_length() - 1

M = int(input())
if M == 0:
    print(1)
    print(1)
else:
    M_plus_1 = M + 1
    if is_power_of_two(M_plus_1):
        k = find_k(M_plus_1)
        N = k + 1
        p = 3  # Choosing p=3 for example
        A = [1] + [p * i for i in range(1, k + 1)]
        print(N)
        print(' '.join(map(str, A)))
    else:
        # If M_plus_1 is not a power of two, another approach is needed.
        # For the sake of example, we'll handle it by constructing a specific case.
        # This part is a placeholder and may need adjustment based on specific cases.
        print(3)
        print('1 3 6')