#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
const long long LINF = 1e18;
const double pi = 3.1415926535897932;
const string endstr = "\n";
template <typename T>
T gcd(T a, T b) {
  return (a == 0) ? b : gcd(b % a, a);
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
bool p_comp_fs(const pair<long long, long long> p1,
               const pair<long long, long long> p2) {
  return p1.first < p2.first;
};
bool p_comp_fg(const pair<long long, long long> p1,
               const pair<long long, long long> p2) {
  return p1.first > p2.first;
};
bool p_comp_ss(const pair<long long, long long> p1,
               const pair<long long, long long> p2) {
  return p1.second < p2.second;
};
bool p_comp_sg(const pair<long long, long long> p1,
               const pair<long long, long long> p2) {
  return p1.second > p2.second;
};
template <typename T>
vector<T> uniquen(vector<T> vec) {
  vec.erase(unique(vec.begin(), vec.end()), vec.end());
  return vec;
}
string s;
bool solve_dp(vector<long long>& vector<string>, long long goal) {
  set<long long> sp;
  sp.insert(0);
  for (long long i = 0; i < vector<string>.size(); i++) {
    set<long long> sn;
    for (long long cur_s : sp) {
      sn.insert(cur_s + vector<string>[i]);
      sn.insert(cur_s - vector<string>[i]);
    }
    sp = std::move(sn);
  }
  return sp.count(goal) == 1;
}
long long S(long long x) {
  string s = to_string(x);
  long long ans = 0;
  for (long long i = 0; i < s.size(); i++) {
    ans += stoll(s.substr(i, 1));
  }
  return ans;
}
int main() {
  long long k;
  cin >> k;
  long long cnt = 0;
  string s = "9";
  while (cnt < k) {
    if (cnt < 9) {
      cnt++;
      cout << cnt << endl;
    } else {
      if (s[0] == '9') {
        s = "1" + s;
        cout << s << endl;
        cnt++;
      } else {
        long long init = stoll(s.substr(0, 1));
        s = to_string(init + 1) + s.substr(1, s.size() - 1);
        cout << s << endl;
        cnt++;
      }
    }
  }
  return 0;
}
