#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const double PI = acos(-1.0);
const long long MOD = 1000000007LL;
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int K;
  cin >> K;
  vector<long long> A(101010);
  vector<long long> num(20, 1);
  for (int i = 0; i < (int)(18); ++i) num[i + 1] = 10 * num[i];
  for (int i = 0; i < (int)(9); ++i) A[i] = i + 1;
  for (int i = 9; i <= 150; i++) {
    int k = i / 9;
    int l = i % 9 + 2;
    A[i] = num[k] * l - 1;
  }
  for (int i = 0; i < (int)(K); ++i) cout << A[i] << '\n';
}
