#include <bits/stdc++.h>
using namespace std;
long long modexpo(long long x, long long y, long long m) {
  x = x % m;
  if (y == 0) {
    return 1;
  }
  if (y % 2 == 0) {
    return modexpo(x * x, y / 2, m);
  } else {
    return (x * modexpo(x * x, y / 2, m)) % m;
  }
}
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
char ar[10] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
int n;
int main() {
  int i, j;
  cin >> n;
  j = 0;
  string second = "0";
  for (int i = 1; i <= n; i++) {
    second[j] = ar[second[j] - '0' + 1];
    cout << stoi(second) << endl;
    if (second[j] == '9') {
      second = "0" + second;
    }
  }
  return 0;
}
