#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T pow(T a, long long n) {
  T ret = 1;
  while (n) {
    if (n & 1) ret *= a;
    n >>= 1;
    a *= a;
  }
  return ret;
}
int digit_sum(long long n, int base = 10) {
  int res = 0;
  while (n > 0) res += n % base, n /= base;
  return res;
}
int main() {
  long long k;
  cin >> k;
  set<long long> se;
  for (int d = 0; d < 15; d++)
    for (int pref = 1; pref < 1000; pref++) {
      se.emplace(pref * pow(10LL, d) - 1);
    }
  se.erase(0);
  vector<pair<long long, int>> cand;
  for (auto x : se) cand.emplace_back(x, digit_sum(x));
  reverse(begin(cand), end(cand));
  vector<long long> res;
  pair<long long, int> pre = {pow(10LL, 18), 1};
  for (auto &p : cand) {
    if (p.first * pre.second <= pre.first * p.second) {
      res.emplace_back(p.first);
      pre = p;
    }
  }
  reverse(begin(res), end(res));
  for (int i = 0; i < res.size(); i++) cout << res[i] << endl;
  return 0;
}
