#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
ll digit(ll n) {
  ll res = 0;
  while (n > 9) {
    res += n % 10;
    n /= 10;
  }
  return res + n;
}
void solve() {
  ll k;
  cin >> k;
  vector<pair<double, ll>> v;
  for (int i = 1; i < 10000000; i++) {
    v.push_back(make_pair((i / digit(i)), i));
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < k; i++) {
    cout << v[i].second << endl;
  }
}
int main() {
  solve();
  return 0;
}
