#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


# %%
import numpy as np


# %%
def prime_table(N):
    """Create prime table of interval [0, N)

    Parameters
    ----------
    N : int
        Upper bound. N must be >= 2.

    Returns
    -------
    tuple of two arrays.
    is_prime: is_prime[i] = True iff i is prime.
    primes: primes[i] = (i+1)-th prime
    """
    is_prime = np.zeros(N, np.bool_)
    is_prime[2] = 1
    is_prime[3::2] = 1
    for p in range(3, N, 2):
        if p * p > N:
            break
        if is_prime[p]:
            is_prime[p * p::p + p] = 0
    primes = np.where(is_prime)[0]
    return is_prime, primes


# %%
K = int(readline())

if K == 0:
    print(1)
    print(1)
    exit()

# %%
is_prime, primes = prime_table(10 ** 4)

# %%
n = 0
while (n + 1) * (n + 2) // 2 <= K and n < 100:
    n += 1

C = [1] * n + [2]
rest = K - n * (n + 1) // 2
k = rest // n
C += [4] * k
rest -= n * k

# %%
primes = primes[~(is_prime[primes + 2])]
C += (primes[10:10 + rest] - 2).tolist()
print(len(C))
print(*C)