#include <bits/stdc++.h>
using namespace std;
double dsum(double n) {
  double sum = 0;
  while (n > 0) {
    sum += (long)n % 10;
    n /= 10;
  }
  return sum;
}
int main() {
  int k;
  cin >> k;
  vector<double> s;
  for (int i = 1; i < 10; i++) {
    s.push_back(i);
    s.push_back(i * 10 + 9);
    s.push_back(i * 100 + 99);
  }
  for (int i = 3; i <= 15; i++)
    for (int j = 1; j < 140; j++) s.push_back(j * pow(10, i) - 1);
  sort(s.begin(), s.end());
  s.erase(unique(s.begin(), s.end()), s.end());
  double d[s.size()];
  for (int i = 0; i < (s.size()); i++) d[i] = s[i] / dsum(s[i]);
  for (int i = 0; i < (s.size()); i++) {
    bool flag = true;
    for (int j = i + 1; j < s.size(); j++) {
      if (d[i] > d[j]) {
        flag = false;
        break;
      }
    }
    if (flag) {
      cout << (long)s[i] << endl;
      k--;
    }
    if (k == 0) break;
  }
}
