#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  cin >> k;
  priority_queue<double> q;
  int i = 0;
  while (k != 0) {
    int a = (i) % 9 + 1;
    stringstream ss;
    ss << a;
    string ans;
    ss >> ans;
    for (int j = 0; j < i / 9; j++) {
      ans += '9';
    }
    stringstream sss;
    sss << ans;
    long long int num;
    sss >> num;
    long long int dig = 0;
    long long int tmp = num;
    while (tmp != 0) {
      dig += tmp % 10;
      tmp /= 10;
    }
    double pu = static_cast<double>(num) / static_cast<double>(dig);
    q.push(pu);
    if (q.top() == pu) {
      cout << ans << endl;
      k--;
    }
    i++;
  }
  return 0;
}
