#include <bits/stdc++.h>
using namespace std;
int S(int n) {
  int r = 0;
  for (int t = n; t > 0; t /= 10) {
    r += t % 10;
  }
  return r;
}
int main(void) {
  int K;
  cin >> K;
  int n = 1;
  int m;
  int count = 0;
  double epsilon = 1e-10;
  while (count < K) {
    m = n - (n % 10) + 9;
    if ((m / (double)S(m)) > (n / (double)S(n)) ||
        fabs((m / (double)S(m)) - (n / (double)S(n))) < epsilon) {
      cout << n << endl;
      count++;
    }
    n++;
  }
  return 0;
}
