#include <bits/stdc++.h>
void sort(int *x, int left, int right) {
  int pivot, left_hold, right_hold;
  left_hold = left;
  right_hold = right;
  pivot = x[left];
  while (left < right) {
    while ((x[right] >= pivot) && (left < right)) right--;
    if (left != right) {
      x[left] = x[right];
      left++;
    }
    while ((x[left] <= pivot) && (left < right)) left++;
    if (left != right) {
      x[right] = x[left];
      right--;
    }
  }
  x[left] = pivot;
  pivot = left;
  left = left_hold;
  right = right_hold;
  if (left < pivot) sort(x, left, pivot - 1);
  if (right > pivot) sort(x, pivot + 1, right);
}
int main() {
  int i, K, s[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 19};
  scanf("%d", &K);
  if (K > 10) K = 10;
  for (i = 1; i <= K; i++) printf("%d\n", s[i - 1]);
}
