def isPrime(n): for i in range(2,n//2+1): if n%i==0: return False else: return True

l=eval(input()) s=n=0

if l==1:
print() print(0) else: for i in range(2,int(10**2.5)): if isPrime(i) and s+i<=l: n+=1 s+=i print(i) print(n)