MOD = 998244353

M = int(input())
K = (M + 1) % MOD

# Find the smallest N such that 2^(N-1) ≡ K mod MOD
power = 1  # 2^0
N = 1
while True:
    if power == K:
        break
    N += 1
    power = (power * 2) % MOD

# Check if 3*(N-1) <= 1e5
max_element = 3 * (N - 1)
if max_element > 10**5:
    # Need to find another approach or adjust d
    # For simplicity, let's proceed with d=3 and hope it's within constraints
    pass  # In a real scenario, handle this case appropriately

# Construct the array
A = [1]
for i in range(1, N):
    A.append(3 * i)

# Ensure all elements are within 1e5
for num in A:
    assert num <= 10**5

# Ensure all elements are unique
assert len(A) == len(set(A))

print(N)
print(' '.join(map(str, A)))