#include <bits/stdc++.h>
using namespace std;
char to_upper(char x) {
  if (97 <= int(x) && int(x) <= 126)
    return char(x - 32);
  else if (65 <= int(x) && int(x) <= 90)
    return x;
}
char to_lower(char x) {
  if (97 <= int(x) && int(x) <= 126)
    return x;
  else if (65 <= int(x) && int(x) <= 90)
    return char(x + 32);
}
int numerize(char x) {
  if (48 <= int(x) && int(x) <= 57)
    return int(x - '0');
  else if (97 <= int(x) && int(x) <= 126)
    return int(x - 96);
  else if (65 <= int(x) && int(x) <= 90)
    return int(x - 64);
}
long long n;
int snuke(int x) {
  int res = 0;
  while (x > 0) {
    res += x % 10;
    x /= 10;
  }
  return res;
}
long long cons(long long x, long long y) {
  long long mul = 1;
  long long res = 0;
  for (int i = 1; i <= y; i++) {
    res += mul * 9;
    mul *= 10;
  }
  res += mul * x;
  return res;
}
vector<int> sn;
long long k;
queue<long long> q;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> k;
  int big = 0;
  for (int i = 1; i <= 5000; i++) {
    sn.push_back(i / snuke(i));
  }
  for (int i = 0; i < sn.size(); i++) {
    bool z = true;
    for (int j = i + 1; j < sn.size(); j++) {
      if (sn[i] > sn[j]) {
        z = false;
        break;
      }
    }
    if (z) {
      q.push(i + 1);
      if (i + 1 == 2999) break;
    }
  }
  n = 2;
  long long stp = 30;
  long long nine = 3;
  long long z = 2999;
  while (q.size() < k) {
    n++;
    if (n == stp) {
      n = nine;
      nine++;
      stp = nine * 10;
    }
    z = cons(n, nine);
    q.push(z);
  }
  for (int i = 1; i <= k; i++) {
    cout << q.front() << '\n';
    q.pop();
  }
}
