#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;
}
int main() {
  long long n;
  cin >> n;
  if (n <= 9) {
    for (int i = 1; i <= n; i++) cout << i << '\n';
    return 0;
  }
  for (int i = 1; i <= 9; i++) cout << i << '\n';
  n -= 9;
  for (long long i = 1; i <= n; i++) {
    cout << i;
    cout << 9;
    cout << '\n';
  }
  getchar();
  getchar();
  return 0;
}
