#include <bits/stdc++.h>
using namespace std;
const long double pi = 2 * acos(0.0);
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a * (b / gcd(a, b));
}
template <class T, class TT>
bool pal(T a, TT n) {
  int k = 0;
  for (int i = 0; i <= n / 2; i++) {
    if (a[i] != a[n - i - 1]) {
      k = 1;
      break;
    }
  }
  return k ? 0 : 1;
}
long long a[222222 * 10];
int main() {
  long long n;
  cin >> n;
  long long s = 1, cur = 1;
  for (long long i = 1; i <= n; i++) {
    cout << cur << '\n';
    long long q = cur, p = 0, k = 0, cnt = 0;
    while (q > 0) {
      k = q % 10;
      if (k == 9)
        cnt++;
      else
        break;
      q /= 10;
    }
    if (!q && cur != 99) cnt--;
    long long foo = 1;
    while (cnt--) foo *= 10;
    cur += foo;
  }
  getchar();
  getchar();
  return 0;
}
