#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

#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)

int N;
vector<string> seq[10];
int editDis(string a, string b)
{
    int ans = 0;
    FOR(i, a.length())
        ans += a[i] != b[i];
    return ans;
}
int main()
{
    cin >> N;
    for (char i = 'a'; i <= 'y'; i++)
    {
        string temp1 = "", temp2 = "";
        temp1 += i;
        temp1 += i;
        temp2 += i;
        temp2 += i + 1;
        seq[1].push_back(temp1);
        seq[1].push_back(temp2);
    }
    seq[1].push_back("zz");
    int until = 0;
    FR(i, 2, 10)
    {
        for (char j = 'a'; j <= 'y'; j++)
        {
            if ((j - 'a') % 2 == 0)
            {
                FOR(k, SZ(seq[i - 1]))
                {
                    string temp = "";
                    temp += j;
                    temp += j;
                    temp += seq[i - 1][k];
                    seq[i].push_back(temp);
                }
            }
            else
            {
                for (int k = SZ(seq[i - 1]) - 1; k >= 0; k--)
                {
                    string temp = "";
                    temp += j;
                    temp += j;
                    temp += seq[i - 1][k];
                    seq[i].push_back(temp);
                }
            }
            string temp = seq[i][SZ(seq[i]) - 1];
            temp[1] = j + 1;
            seq[i].push_back(temp);
        }
        string temp = seq[i][SZ(seq[i]) - 1];
        temp[0] = 'z';
        seq[i].push_back(temp);
        if (SZ(seq[i]) >= 5005)
        {
            until = i;
            break;
        }
    }
    FOR(i, N)
        cout << seq[until][i] << "\n";
}