#include <bits/stdc++.h>
long long z = 1000000007;
long long inf = 100000000000000000;
long long gcd(long long a, long long b) {
  if (b > a) return gcd(b, a);
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long a, long long b) {
  if (b == 0) return 1;
  long long c = power(a, b / 2);
  if (b % 2 == 0)
    return ((c * c) % z);
  else
    return ((((c * c) % z) * a) % z);
}
long long inverse(long long a, long long n) { return power(a, n - 2); }
long long max(long long a, long long b) {
  if (a > b) return a;
  return b;
}
using namespace std;
void solve() {
  long long n;
  cin >> n;
  vector<string> v;
  v.push_back("aaaaaaaaaa");
  v.push_back("aaaaaaaaab");
  v.push_back("aaaaaaaaba");
  v.push_back("aaaaaaaabb");
  v.push_back("aaaaaaaabc");
  v.push_back("aaaaaaabaa");
  v.push_back("aaaaaaabab");
  v.push_back("aaaaaaabac");
  v.push_back("aaaaaaabba");
  v.push_back("aaaaaaabbb");
  for (long long i = 0; i < n; i++) {
    string s;
    for (long long j = 10 - n; j < 10; j++) {
      s += v[i][j];
    }
    cout << s << '\n';
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
