#include <bits/stdc++.h>
int PrimeNumber(int n) {
  if (n < 2) return 0;
  if (n == 2) return 1;
  if (n % 2 == 0) return 0;
  double sqnum = sqrt(n);
  for (int i = 3; i <= sqnum; i += 2) {
    if (n % i == 0) return 0;
  }
  return 1;
}
int main() {
  int num = 0;
  int count = 0;
  scanf("%d", &num);
  for (int i = 2; i < num; i++) {
    if (PrimeNumber(i) == 1) {
      count++;
      printf("%d\n", i);
    }
  }
  return 0;
}
