#include <bits/stdc++.h>
using namespace std;
int n;
long long pre[20];
long long cal(long long x) {
  long long ret = 0;
  while (x) ret++, x /= 10;
  return pre[ret - 1];
}
int main() {
  pre[0] = 1;
  for (int i = 1; i <= 16; i++) pre[i] = pre[i - 1] * 10;
  scanf("%d", &n);
  long long cur = 1;
  for (int i = 1; i <= n; i++)
    cur = cur + cal(cur), printf("%lld\n", cur - 1ll);
  return 0;
}
