m = int(input())
nums = []
for i in range(1,30):
  nums.append((1<<i)-1)

import bisect
use = []
left = m
while left:
  t = bisect.bisect_right(nums, left)
  use.append(t)
  left -= nums[t-1]

def e(n): #O(NloglogN)
  l = [True]*(n+1)
  l[0] = False
  l[1] = False
  for i in range(2,n):
    if l[i]:
      for p in range(i+i,n+1,i):
        l[p] = False
  return l

t = e(10**5)
pn = []
cnt = 0
luse = len(use)
for i in range(2, 10**5):
  if t[i]:
    pn.append(i)
    cnt += 1
  if cnt == luse: break
from math import gcd
ans = set()
for i in range(luse):
  nn = use[i]
  p = pn[i]
  cnt = 0
  for j in range(p, 10**5,p):
    flg = True
    for k in pn:
      if k == p: continue
      if j % k == 0: flg = False
    if flg:
      ans.add(j)
      cnt += 1
    if cnt == nn: break
print(len(ans))
print(*ans)