#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e15 + 10;
long long k;
long long f(long long n) {
  long long res = 0;
  while (n > 0) {
    res += n % 10;
    n /= 10;
  }
  return res;
}
double g(long long n) { return (double)n / f(n); }
long long calc(long long n) {
  double minVal = INF;
  long long currentN = 0;
  for (long long i = n; i <= n * 100; i++) {
    double tmp = g(i);
    if (tmp < minVal) {
      currentN = i;
      minVal = tmp;
    }
  }
  return currentN;
}
void solve() {
  long long n = 1;
  for (int i = 0; i < k; i++) {
    cout << n << endl;
    n = calc(n + 1);
  }
}
int main() {
  cin >> k;
  solve();
}
