#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int INF = 1e9;
const long long int MAXN = 1e9;
long long int digit(long long int n) {
  if (n < 10)
    return n;
  else
    return n % 10 + digit(n / 10);
}
long long int f(long long int n) {
  int d = 0;
  long long int m = n;
  while (m >= 10) {
    m /= 10;
    d++;
  }
  long long int res = INF;
  double now = (double)INF;
  for (int i = m; i <= 9; i++) {
    long long int x = pow(10, d) * i;
    for (long long int j = 0; j < d; j++) {
      x += pow(10, j) * 9;
    }
    if (now > (double)x / digit(x)) {
      res = x;
      now = (double)x / digit(x);
    }
  }
  return res;
}
int main() {
  long long int k;
  cin >> k;
  int a = 1;
  for (int i = 1; i <= k; i++) {
    cout << a << endl;
    a = f(a + 1);
  }
  return 0;
}
