#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long INF = 1e18;
const int mod = 1000000007;
template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <typename T>
T pow(T a, int b) {
  return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
long long modpow(long long a, int b, int _mod) {
  return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
  for (auto& vi : vec) os << vi << " ";
  return os;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T>
inline istream& operator>>(istream& is, vector<T>& v) {
  for (int j = 0; j < ((int)v.size()); ++j) is >> v[j];
  return is;
}
template <class T>
inline void add(T& a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
void solve();
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  int T;
  T = 1;
  while (T--) {
    solve();
  }
}
int second(long long x) {
  int ret = 0;
  while (x) {
    ret += x % 10;
    x /= 10;
  }
  return ret;
}
double g(long long x) { return 1.0 * x / second(x); }
void solve() {
  vector<pair<long long, double> > v;
  for (int i = 1; i < (10); ++i) v.emplace_back(i, 1.0);
  for (int i = 10; i < (1001); ++i) {
    for (int j = i + 1; j < (5001); ++j) {
      if (g(i) > g(j)) break;
      if (j == 5000) v.emplace_back(i, g(i));
    }
  }
  for (int i = 2; i < (13); ++i) {
    for (int j = 1; j < (10); ++j)
      for (int k = 0; k < (10); ++k) {
        string s;
        s += j + '0';
        s += k + '0';
        for (int l = 0; l < (i); ++l) s += '9';
        long long x = stoll(s);
        v.emplace_back(x, g(x));
      }
  }
  int n;
  cin >> n;
  int cnt = 0;
  for (int i = 0; i < ((int)v.size()); ++i) {
    for (int j = i + 1; j < ((int)v.size()); ++j) {
      if (v[i].second > v[j].second) break;
      if (j == (int)v.size() - 1) {
        cnt++;
        cout << v[i].first << endl;
        if (cnt == n) return;
      }
    }
  }
}
