#include <bits/stdc++.h>
using namespace std;
constexpr int kMod = 1000000007;
int S(long long n) {
  int ans = 0;
  while (n > 0) {
    ans += n % 10;
    n /= 10;
  }
  return ans;
}
int main() {
  long long K;
  cin >> K;
  int i = 1, j = 0, cnt = 0;
  while (cnt < K) {
    int x = S(i);
    if (x > j) {
      cout << i << endl;
      ++cnt;
      j = x;
    }
    ++i;
  }
}
