#include <bits/stdc++.h>
using namespace std;
const long long Max = 10000000000000000ll;
int N, p = 1, M;
long long F[10005], x;
inline long long S(long long x) {
  long long sul = 0;
  while (x) sul += x % 10, x /= 10;
  return sul;
}
int main() {
  scanf("%d", &N);
  for (x = 1, p = 10; x < Max; x *= 10, p += 10)
    for (int i = p; i > 1; --i) F[M++] = i * x - 1;
  sort(F, F + M);
  for (int i = 0; i < N; ++i) printf("%lld\n", F[i]);
  return 0;
}
