#include <bits/stdc++.h>
using namespace std;
using ll = long long;
namespace NS {
void LoopUntilZeroInpput() {
  int hogegegege = 0;
  while (cin >> hogegegege && hogegegege != 0) {
  }
}
}  // namespace NS
ll Cal(ll ipt) {
  if (ipt <= 0) {
    return -1;
  }
  ll tmp = ipt;
  ll ans = 0;
  while (ipt > 0) {
    ans += ipt % 10;
    ipt /= 10;
  }
  return tmp / ans;
}
int main() {
  ll K;
  cin >> K;
  ll cnt = 0, pos = 9;
  vector<ll> tmpAns(9, 0);
  int tmpAnsPos;
  while (cnt < K) {
    tmpAnsPos = 0;
    ll last = Cal(pos);
    tmpAns[tmpAnsPos] = pos;
    ++tmpAnsPos;
    ++cnt;
    while (last == Cal(pos - tmpAnsPos)) {
      if (cnt == K) {
        break;
      }
      tmpAns[tmpAnsPos] = pos - tmpAnsPos;
      ++tmpAnsPos;
      ++cnt;
    }
    for (int i = tmpAnsPos - 1; i >= 0; --i) {
      cout << tmpAns[i] << '\n';
    }
    pos += 10;
  }
  cout << flush;
}
