#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
constexpr 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;
  for (int i = 1; i < 1000; i++) {
    int p = i;
    int cnt = 0;
    while (p > 0) {
      cnt++;
      p /= 10;
    }
    long long val = i;
    for (int j = 0; j < (15 - cnt); ++j) {
      A.emplace_back(val);
      val *= 10;
      val += 9;
    }
  }
  sort((A).begin(), (A).end());
  A.erase(unique(begin(A), end(A)), end(A));
  int M = A.size();
  vector<long long> B(M);
  for (int i = 0; i < (M); ++i) {
    long long p = A[i];
    while (p > 0) {
      B[i] += p % 10;
      p /= 10;
    }
  }
  for (int i = 0; i < (M); ++i) {
    bool ok = true;
    for (int j = i + 1; j < M; j++) {
      if (A[i] * B[j] > A[j] * B[i]) ok = false;
    }
    if (ok) {
      cout << A[i] << '\n';
      K--;
      if (!K) return 0;
    }
  }
}
