#include <bits/stdc++.h>
using namespace std;
int bs(vector<long long>& a, int que) {
  auto it = lower_bound(a.begin(), a.end(), que);
  if (*it == que) {
    return it - a.begin();
  }
  return -1;
}
void subsets(int S[], int n) {
  int nSub = 1 << n;
  for (int i = 0; i < nSub; i++) {
    cout << "{ ";
    for (int k = 0; k < n; k++) {
      if ((1 << k) & i) {
        cout << S[k] << " ";
      }
    }
    cout << "}\n";
  }
}
void permutate() {
  int n, x;
  cin >> n;
  vector<int> permutation;
  for (int i = 0; i < n; i++) {
    cin >> x;
    permutation.push_back(x);
  }
  do {
    for (int i = 0; i <= n - 1; i++) cout << permutation[i];
    cout << endl;
  } while (next_permutation(permutation.begin(), permutation.end()));
}
bool prima(int x) {
  if (x == 1) {
    return false;
  }
  for (int i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) {
      return false;
    }
  }
  return true;
}
long long s(long long x) {
  string sol = to_string(x);
  long long sum = 0;
  for (int i = 0; i <= sol.size() - 1; i++) sum = sum + (long long)sol[i] - '0';
  return sum;
}
int main() {
  long long k;
  cin >> k;
  long long x = 1;
  if (k <= 9) {
    for (int i = 1; i <= k; i++) cout << i << endl;
    return 0;
  }
  while (k >= 1) {
    if (x / s(x) == 1) {
      cout << x << endl;
      k--;
    }
    x++;
  }
  return 0;
}
