#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define PB push_back
#define MP make_pair
#define A first
#define B second
#define SZ(x) int(x.size())
#define FR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR(i, n) FR(i, 0, n)
const int M = 1000000007;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

int n;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    vector<string> ans = {"aaaaaaaaaa"};
    FR(i, 1, n) {
        string t = ans.back();
        bool find = false;
        int off1 = rnd() % 10;
        FOR(j, 10) {
            int J = (j + off1) % 10;
            if (find) break;
            int off2 = rnd() % 26;
            FOR(k, 26) {
                int K = (k + off2) % 26;
                string nxt = t;
                nxt[J] = (char)(K + 'a');
                int ok = 0;
                FOR(l, SZ(ans)) {
                    int like = 0;
                    FOR(m, 10) if (nxt[m] == ans[l][m]) like++;
                    if (like == 10) ok += 2;
                    if (like == 9) ok++;
                    if (ok >= 2) break;
                }
                if (ok == 1) {
                    ans.PB(nxt);
                    find = true;
                }
                if (find) break;
            }
        }
// cerr << i << ' ' << ans.back() << '\n';        
    }
    FOR(i, SZ(ans)) cout << ans[i] << '\n';

}