#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Mod = 1000000007;
ll sll(string s) {
  ll res = 0;
  int N = s.size();
  ll ten[17];
  ten[0] = 1;
  for (ll i = 1; i <= 16; i++) {
    ten[i] = ten[i - 1] * 10LL;
  }
  for (ll i = 0; i < N; i++) {
    int num = s[N - 1 - i] - '0';
    ll num_ll = num;
    res += num_ll * ten[i];
  }
  return res;
}
int main() {
  ll K;
  cin >> K;
  ll cnt = 0;
  ll ten[17];
  ten[0] = 1;
  for (ll i = 1; i <= 16; i++) {
    ten[i] = ten[i - 1] * 10LL;
  }
  for (ll i = 1; i <= K; i++) {
    char s = i % 9 + '0';
    if (s == '0') s = '9';
    string ans = "";
    ans += s;
    ans += string((i - 1) / 9, '9');
    ll ans2 = sll(ans);
    cout << ans2 << endl;
    cnt++;
    if (cnt == K) {
      return 0;
    }
    if (ans2 > 100LL && s != '9') {
      ll digit = (i + 8) / 9;
      for (int j = 2; j <= digit; j++) {
        ll l = (i + 1) * (ans2 + ten[digit - 1] - ten[digit - j]);
        ll r = i * (ans2 + ten[digit - 1]);
        if (l < r) {
          cout << (ans2 + ten[digit - 1] - ten[digit - j]) << endl;
          cnt++;
          if (cnt == K) {
            return 0;
          }
        }
      }
    }
    if (ans2 > 100LL && s == '9') {
      ll digit = (i + 8) / 9;
      ll l = (i + 1) * (ans2 + ten[digit] - ten[digit - 1]);
      ll r = i * (ans2 + ten[digit]);
      if (l < r) {
        cout << (ans2 + ten[digit] - ten[digit - 1]) << endl;
        cnt++;
        if (cnt == K) {
          return 0;
        }
      }
    }
  }
  return 0;
}
