#include <bits/stdc++.h>
using namespace std;
constexpr int kMod = 1000000007;
int S(long long n) {
  int ans = 0;
  while (n > 0) {
    ans += n % 10;
    n /= 10;
  }
  return ans;
}
int main() {
  long long K;
  cin >> K;
  for (int i = 1; i <= 9; ++i) cout << i << endl;
  vector<long long> v;
  for (int i = 1; i <= 9; ++i) v.push_back(i);
  long long base = 1;
  while (v.size() < 2 * K) {
    for (long long i = 1; i <= 9; ++i) {
      v.push_back((10LL * i + 9LL) * base);
    }
    base = 10LL * base;
  }
  vector<long long> v2;
  double vmax = DBL_MAX;
  for (auto it = v.rbegin(); it != v.rend(); ++it) {
    double x = (double)(*it) / S(*it);
    if (vmax < x) continue;
    vmax = x;
    v2.push_back(*it);
  }
  long long cnt = 0;
  for (auto it = v2.rbegin(); it != v2.rend() && cnt < K; ++it, ++cnt) {
    cout << *it << endl;
  }
}
