#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
inline long long int input() {
  long long int n;
  cin >> n;
  return n;
}
long long int poww(long long int a, long long int b, long long int md) {
  return (!b ? 1
             : (b & 1 ? a * poww(a * a % md, b / 2, md) % md
                      : poww(a * a % md, b / 2, md) % md));
}
const long long int MAXN = 2e5 + 10;
const long long int MAXA = 101;
const long long int INF = 8e18;
const long long int MOD = 1e9 + 7;
const long double PI = 4 * atan((long double)1);
long long int prime[MAXN];
void sett() {
  fill(prime, prime + MAXN, 1);
  for (long long int p = 2; p * p <= MAXN; p++) {
    if (prime[p] == 1) {
      for (long long int i = p * p; i <= MAXN; i += p) prime[i] = 0;
      for (long long int i = p * p; i <= MAXN; i *= p) prime[i] = 2;
    }
  }
}
vector<long long int> v;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  ;
  long long int n;
  cin >> n;
  sett();
  for (long long int i = 2; i <= n; i++) {
    if (prime[i]) v.push_back(i);
  }
  cout << (long long int)v.size() << '\n';
  for (auto i : v) cout << i << " ";
  ;
  return 0;
}
