import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum LIM = 10^^5;
bool[] isnp;
int[] primes;

void main() {
  isnp = new bool[LIM];
  foreach (p; 2 .. LIM) if (!isnp[p]) {
    primes ~= p;
    for (int n = 2 * p; n < LIM; n += p) isnp[n] = true;
  }
  
  try {
    for (; ; ) {
      long M = readLong;
      if (M == 0) {
        M += 998244353;
      }
      
      int[] es;
      {
        long m = M;
        foreach_reverse (e; 1 .. 40) {
          const dm = (1L << e) - 1;
          for (; m >= dm; ) {
            m -= dm;
            es ~= e;
          }
        }
      }
      const esLen = cast(int)(es.length);
      debug {
        writeln("es = ", es);
      }
      
      int[] as;
      {
        int j = esLen;
        foreach (i; 0 .. esLen) {
          foreach (_; 0 .. es[i]) {
            as ~= primes[esLen - 1 - i] * primes[j++];
          }
        }
      }
      
      writeln(as.length);
      foreach (index, a; as) {
        if (index) write(" ");
        write(a);
      }
      writeln;
    }
  } catch (EOFException e) {
  }
}