#include <iostream>
#include <cmath>
using namespace std;

bool isPrime(int n) {
  if (n <= 1) return false;
  for (int i = 2; i <= sqrt(n); ++i) {
    if (n % i == 0) return false;
  }
  return true;
}

int main() {
  int N;
  cin >> N;
  int count = 0;
  for (int i = 2; i <= N; ++i) {
    if (isPrime(i)) {
      cout << i << " ";
      count++;
      if (count % 5 == 0) cout << endl;
    }
  }
  if (count % 5 != 0) cout << endl;
  return 0;
}