#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const long long LINF = 1e18;
long long int n, cnt = 0, ans = 0, a, b, c, d, cmp, cmpp, summ, m, h, w, x, y,
                 sum = 0, pos, k;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl = true;
struct edge {
  int to, cost;
};
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> k;
  if (k <= 9) {
    for (long long int(i) = 0; (i) < (int)(k); (i)++) cout << (i + 1) << endl;
  } else {
    for (long long int(i) = 0; (i) < (int)(9); (i)++) cout << (i + 1) << endl;
    k -= 9;
    cnt = 10;
    while (1) {
      pos = cnt;
      while (1) {
        pos++;
        if (pos % 10 == 9) break;
      }
      cmp = cnt;
      while (cmp != 0) {
        sum += cmp % 10;
        cmp /= 10;
      }
      cmpp = pos;
      while (cmpp != 0) {
        summ += cmpp % 10;
        cmpp /= 10;
      }
      double Q, QQ;
      Q = (double)cnt / sum;
      QQ = (double)pos / summ;
      if (Q <= QQ) cout << (cnt) << endl, k--;
      cnt++;
      sum = 0;
      summ = 0;
      if (k == 0) break;
    }
  }
  return 0;
}
