#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007ll;
const long long inf = 1000000000000000ll;
const long long MAX_N = 100000;
long long N, K, a[MAX_N + 1];
int main() {
  long long snum = 0;
  double sprev = 1.0;
  cin >> K;
  for (long long tmp = 2;; tmp++) {
    long long N = tmp;
    long long S = 0;
    for (long long i = 16; 0 <= i; i--) {
      S += (long long)(N / pow(10, i));
      N -= (long long)(pow(10, i) * (long long)(N / pow(10, i)));
    }
    if ((tmp * 1.0) / (S * 1.0) >= sprev) {
      cout << tmp - 1 << endl;
      snum++;
      if (snum == K) break;
    }
    sprev = (tmp * 1.0) / (S * 1.0);
  }
  return 0;
}
