#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const long long LINF = 1e18;
long long int n, cnt = 0, ans = 0, a, b, c, d, cmp, cmpp, m, h, w, x, y,
                 sum = 0, pos;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl = true;
struct edge {
  int to, cost;
};
long long Sum(long long x) {
  sum = 0;
  while (x != 0) {
    sum += x % 10;
    x /= 10;
  }
  return sum;
}
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  for (long long i = 49999; i <= 10000000; i++) {
    double Q = (double)i / Sum(i);
    cout << "a" << Sum(i) << "\n";
    fl = true;
    for (long long j = i + 1; j <= 10000000; j++) {
      double QQ = (double)j / Sum(j);
      if (Q > QQ) fl = false;
    }
    if (fl) cout << (i) << endl;
  }
  return 0;
}
