#include <bits/stdc++.h>
using namespace std;
long long INF = 1LL << 30;
int dxy4[5] = {0, 1, 0, -1, 0};
int dxy8[9] = {0, 1, 1, 0, -1, 1, -1, -1, 0};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
long long mod7 = 1000000007;
long long mod9 = 1000000009;
int a[100000] = {};
int aa(int a) {
  int c = 0;
  while (a) {
    c += a % 10;
    a /= 10;
  }
  return c;
}
int main() {
  int k;
  cin >> k;
  int x;
  int s = 0;
  while (k > 0) {
    x = min(k, 9);
    for (int i = 0; i < x; ++i) {
      cout << i + 1;
      if (s) cout << s;
      cout << endl;
    }
    s *= 10;
    s += 9;
    k -= 9;
  }
  int nn;
  cin >> nn;
  return 0;
}
