#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 2;
const int mod = 1e9 + 7;
int main() {
  unsigned long long n, c = 0;
  int arr[9] = {19, 29, 39, 49, 59, 69, 79, 89, 99};
  set<unsigned long long> st;
  for (int i = 0; i < (int)(9); ++i) st.insert(i + 1);
  for (int i = 0; i < (int)(9); ++i) st.insert(arr[i]);
  scanf("%lld", &n);
  unsigned long long i = 0, k = 100, k2 = 100, l = 2;
  c = n;
  while (n--) {
    int nm = (arr[i++] + k);
    st.insert(nm);
    if (i == 9) {
      i = 0;
      k = k2 * (l++);
    }
  }
  for (auto x : st) {
    if (!c) break;
    printf("%lld\n", x);
    c--;
  }
  return 0;
}
