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

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

set<string> st;

bool bad(string &s, string &prv)
{
    string t = s;
    for(int i = 0; i < s.length(); i++)
    {
        for(char c = 'a'; c <= 'z'; c++)
        {
            t[i] = c;
            if(t == prv)
                continue;
            if(st.count(t))
                return true;
        }
        t[i] = s[i];
    }
    return false;
}

void doWork()
{
    int n;
    cin >> n;
    vector<string> v(n, "aaaaaaaaaa");

    st.insert(v[0]);
    int nxtChange = 0;
    for(int i = 1; i < n; i++)
    {
        string nxtString = v[i - 1];
        do
        {
            char nxtChar = (char) ('a' + rng() % 26);
            nxtString[nxtChange] = nxtChar;
        } while(bad(nxtString, v[i - 1]));

        nxtChange++, nxtChange %= 10;
        st.insert(nxtString);
        v[i] = nxtString;
    }

    for(auto &it: v)
        cout << it << '\n';
}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}