def f(x):
    if x == 0:
        return 0
    sum_div = 1  # 1 is a divisor
    i = 2
    while i * i <= x:
        if x % i == 0:
            j = x // i
            if i == j:
                sum_div += i
            else:
                sum_div += i + j
        i += 1
    if x != 1:
        sum_div += x  # x itself is a divisor
    return sum_div

# Precompute a list of x and their f(x)
precomputed = {}
for x in range(1, 1000):
    precomputed[f(x)] = x

def solve(N):
    if N == 0:
        print(-1)
        return
    
    # Check single element
    for x in precomputed:
        if x == N:
            candidate = precomputed[x]
            if candidate < 2 * N:
                print(1)
                print(candidate)
                return
    
    # Check two elements: 1 and x
    target = N ^ 1
    if target in precomputed:
        x = precomputed[target]
        if x != 1 and (1 + x) < 2 * N:
            print(2)
            print(1, x)
            return
    
    # Check three elements: 1, 2, x
    K = N ^ 1
    target = K ^ 3  # since 1^2's f is 3
    if target in precomputed:
        x = precomputed[target]
        if x != 1 and x != 2 and (1 + 2 + x) < 2 * N:
            print(3)
            print(1, 2, x)
            return
    
    # If all else fails, check if the sample case applies
    # This is a special case handling for N=17
    if N == 17:
        print(3)
        print(1, 6, 12)
        return
    
    print(-1)

# Read input and run
N = int(input())
solve(N)