#include <bits/stdc++.h>
using namespace std;
const long long LLINF = 9223372036854775807;
const int MOD = 1000000007;
int dsum(long long n) {
  int result = 0;
  while (n != 0) {
    result += n % 10;
    n /= 10;
  }
  return result;
}
int main() {
  int K;
  cin >> K;
  vector<long long> result;
  long long N = 1;
  cout << N << endl;
  for (int i = 0; i < (int)K - 1; i++) {
    long long tmp_N = N + 1;
    for (int x = 1; x <= N * 10; x *= 10) {
      if (tmp_N * dsum(N + x) > (N + x) * dsum(tmp_N)) tmp_N = N + x;
    }
    N = tmp_N;
    cout << N << endl;
  }
  return 0;
}
