#include <bits/stdc++.h>
double digsum(int n) {
  int array[30], i;
  double sum = 0;
  for (i = 29; i >= 0; i--) {
    array[i] = n / (int)pow(10, i);
    n = n % (int)pow(10, i);
    sum += (double)array[i];
  }
  return sum;
}
int main() {
  int K, count = 0;
  int flag = 1;
  double i, j;
  int *array;
  i = 2;
  scanf("%d", &K);
  array = (int *)malloc(sizeof(int) * K);
  while (count < K) {
    for (j = 1; j < i; j++) {
      if ((j / digsum(j)) >= (i / digsum(i))) flag = 0;
    }
    if (flag == 1) {
      array[count] = i;
      count++;
    }
    i++;
  }
  for (i = 0; i < K; i++) printf("%d\n", array[(int)i]);
  free(array);
  return 0;
}
