#include <bits/stdc++.h>
using namespace std;
vector<long long> factors(long long x) {
  vector<long long> v;
  for (long long i = 1; i <= sqrt(x); ++i) {
    if (x % i == 0) {
      v.push_back(i);
      if (x / i != i) v.push_back(x / i);
    }
  }
  sort(v.begin(), v.end());
  return v;
}
int main() {
  long long k, p = 0;
  cin >> k;
  vector<long long> v;
  unordered_map<long long, long long> m;
  v = factors(k);
  for (long long i = 0; i < v.size(); ++i) {
    if (m[v[i]] == 0) {
      for (long long j = v[i];; ++j) {
        if (j % 10 == 0) break;
        cout << j << endl;
        m[j] = 1;
        p++;
        if (p == k) return 0;
      }
    }
  }
  for (long long i = 1;; ++i) {
    for (long long j = (k * i);; ++j) {
      if (j % 10 == 0 && k % 10 != 0) break;
      cout << j << endl;
      p++;
      if (p == k) return 0;
    }
  }
  return 0;
}
