#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<string> aa, ab, ba, bb;
    for(int mask = 0; mask < 1 << 20; ++mask){
        string s = "";
        for(int i = 0; i < 20; ++i){
            s += (mask >> i & 1) + 'a';
        }
        if(s[0] == 'a'){
            if(s[19] == 'a')    aa.emplace_back(s);
            else    ab.emplace_back(s);
        }
        else{
            if(s[19] == 'a')    ba.emplace_back(s);
            else    bb.emplace_back(s);
        }
    }
    vector<string> ans = bb;
    ans.emplace_back(ba[0]);
    for(int i = 0; i < (int)ab.size(); ++i){
        ans.emplace_back(ba[i]);
        ans.emplace_back(ab[i]);
    }
    copy(aa.begin(), aa.end(), back_inserter(ans));
    for(int i = 0; i < n; ++i)  cout << ans[i] << '\n';

    return 0;
}