#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
void solve_abc101_d() {
  long long K;
  long long ans = 0;
  cin >> K;
  long long cnt1 = 1;
  long long cnt2 = 0;
  long long offset = 0;
  for (long long i = 0; i < (long long)(K); i++) {
    ans = cnt1 * (long long)pow(10, cnt2) + offset;
    cout << ans << endl;
    cnt1++;
    if (cnt1 >= 10) {
      offset += 9 * (long long)pow(10, cnt2);
      cnt1 = 1;
      cnt2++;
    }
  }
}
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve_abc101_d();
  return 0;
}
