#include <bits/stdc++.h>
using namespace std;
const long long LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
int main() {
  long long k;
  cin >> k;
  long long li[] = {1,   2,   3,   4,   5,   6,   7,   8,   9,   19,  29,  39,
                    49,  59,  69,  79,  89,  91,  92,  93,  94,  95,  96,  97,
                    98,  99,  118, 127, 136, 145, 154, 163, 172, 181, 199, 217,
                    227, 236, 245, 254, 263, 271, 272, 299, 316, 326, 336, 345,
                    354, 361, 362, 363, 399, 415, 425, 435, 445, 451};
  for (int i = 0; i < k; i++) {
    cout << li[i] << endl;
  }
  return 0;
}
