#include <bits/stdc++.h>
using namespace std;
struct edge {
  long long int x, c;
};
long long int mod(long long int a, long long int mod) {
  long long int res = a % mod;
  if (res < 0) res = res + mod;
  return res;
}
long long int modpow(long long int a, long long int n, long long int mod) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
long long int modinv(long long int a, long long int mod) {
  long long int b = mod, u = 1, v = 0;
  while (b) {
    long long int t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= mod;
  if (u < 0) u += mod;
  return u;
}
long long int gcd(long long int a, long long int b) {
  long long int r = a % b;
  if (r == 0)
    return b;
  else
    return gcd(b, a % b);
}
bool is_prime(long long int n) {
  long long int i = 2;
  if (n == 1) return false;
  if (n == 2) return true;
  bool res = true;
  while (i * i < n) {
    if (n % i == 0) {
      res = false;
    }
    i = i + 1;
  }
  if (n % i == 0) res = false;
  return res;
}
int main() {
  long long int n;
  cin >> n;
  if (n <= 9) {
    for (long long int i = 0; i < (n); i++) {
      cout << i + 1 << endl;
    }
  } else {
    n -= 9;
    for (long long int i = 0; i < (9); i++) {
      cout << i + 1 << endl;
    }
    long long int c = 1, keta = 2;
    vector<pair<long long int, long long int>> v;
    while (keta < 17) {
      string s = "0";
      s[0] = '0' + c;
      for (long long int i = 0; i < (keta - 1); i++) s += "9";
      v.push_back({stoll(s), (c + (keta - 1) * 9)});
      c += 1;
      if (c == 10) {
        c = 1;
        keta++;
      }
    }
    for (long long int i = 0; i < v.size(); i++) {
      bool flg = true;
      for (long long int j = i + 1; j < v.size(); j++) {
        flg = flg and v[i].second * v[j].first >= v[j].second * v[i].first;
      }
      if (flg) {
        cout << v[i].first << endl;
        n--;
        if (n == 0) return 0;
      }
    }
  }
  return 0;
}
