#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long f(long long x) {
  long long sum = 0, tmp = x;
  while (tmp) {
    sum += tmp % 10;
    tmp /= 10;
  }
  return x / sum;
}
int main() {
  int n;
  scanf("%d", &n);
  int cnt = 0;
  for (long long i = 1; cnt < n; i++) {
    long long muli = i * 10 - 1, snt = 8, tmp = f(muli);
    v.push_back(muli);
    muli--;
    cnt++;
    while (snt-- && tmp >= f(muli)) {
      v.push_back(muli);
      muli--;
      cnt++;
    }
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    printf("%lld\n", v[i]);
  }
}
