#include <bits/stdc++.h>
using namespace std;
template <class T>
bool umax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int findGCD(int arr[], int n) {
  int result = arr[0];
  for (int i = 1; i < n; i++) result = gcd(arr[i], result);
  return result;
}
template <typename T>
T lcm(T m, T n) {
  if ((0 == m) || (0 == n)) return 0;
  return ((m / gcd(m, n)) * n);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
int dx[5] = {1, 0, -1, 0};
int dy[5] = {0, 1, 0, -1};
int main() {
  long long K;
  cin >> K;
  long long p1 = 1;
  long long p9 = 0;
  for (long long i = 1; i <= K; i++) {
    if (i % 9 != 0) {
      cout << p1 * (i % 9) + p9 << endl;
    } else {
      cout << p1 * 9 + p9 << endl;
    }
    if (i % 9 == 0) {
      p1 *= 10;
      p9 *= 10;
      p9 += 9;
    }
  }
  return 0;
}
