// Hey there.. I love you <3

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/numeric>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using L = __int128;


#define fast cin.tie(0), cin.sync_with_stdio(0)
FILE *stream;

#define input(x) freopen_s(&stream, (x), "r", stdin)
#define output(x) freopen_s(&stream, (x), "w", stdout)
#define all(x) x.begin(), x.end()
#define sz(x) ((int)(x).size())
#define maxz(x, y) x = max(x, y)
#define minz(x, y) x = min(x, y)
#define modz(x) x = x % mod + mod, x -= (x >= mod) * mod
#define mp(x, y) make_pair(x, y)
#define f first
#define s second
#define pii pair<int, int>
#define ordered_set(x) tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update> //less_equal
mt19937 rnd(time(nullptr));

const int N = 1e5 + 5, M = N * N, mod = 1e9 + 7;
const ld pi = acos(-1), eps = 1e-6;

set<string> st;
vector<string> ans;

void hi() {
    
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) cout << ans[i] << endl;
    
    
}

void init() {
    fast;
    
    string s(10, 'a');
    st.insert(s);
    ans.push_back(s);
    for (int i = 0; i < 5000; ++i) {
        int ind, val;
        string org = s;
        while (true) {
            ind = rnd() % 10, val = rnd() % 26;
            char o = s[ind];
            s[ind] = val + 'a';
            if (s[ind] != o && st.find(s) == st.end()) break;
            s[ind] = o;
        }
        ans.push_back(s);
        assert(s != org);
        for (int j = 0; j < 10; ++j) {
            char o = org[j];
            for (int k = 0; k < 26; ++k) {
                org[j] = 'a' + k, st.insert(org);
            }
            org[j] = o;
        }
    }
    
}

signed main() {
    init();
    
    int T = 1;
    //cin >> T;
    for (int tc = 1; tc <= T; ++tc) hi();
    
    return 0;
}