#include <bits/stdc++.h>
double power(double a, int b) {
  if (b == 0) {
    return 1;
  } else if (b % 2 == 0) {
    return power(a * a, b / 2);
  } else if (b % 2 == 1) {
    return a * power(a * a, (b - 1) / 2);
  }
}
int sod(int a) {
  int c = 0;
  while (a != 0) {
    c += a % 10;
    a = a / 10;
  }
  return c;
}
bool is_prime(int n) {
  if (n == 1) {
    return false;
  }
  int i = 2;
  while (i * i <= n) {
    if (n % i == 0) {
      return false;
    }
    i += 1;
  }
  return true;
}
int totaldigits(int n) {
  int number_of_digits = 0;
  for (int i = 1; i <= n; i *= 10) number_of_digits += (n - i + 1);
  return number_of_digits;
}
int bs(int arr[], int l, int r, int x) {
  if (r >= l) {
    int mid = l + (r - l) / 2;
    if (arr[mid] == x) return mid;
    if (arr[mid] > x) return bs(arr, l, mid - 1, x);
    return bs(arr, mid + 1, r, x);
  }
  return -1;
}
bool tr(int a, int b, int c) {
  return ((a + b > c) && (a + c > b) && (b + c > a));
}
using namespace std;
void love_for_infinity() {
  long long n, c = 1000000;
  cin >> n;
  for (int i = 1; i <= n; i++) cout << c++ << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  t = 1;
  while (t--) {
    love_for_infinity();
    cout << endl;
  }
  return 0;
}
