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

void solve([[maybe_unused]] int t){
    map<string,bool> vis;
    string st(5,'a');
    
    vector<string> sol;
    auto dfs = [&](auto &dfs,string nodo,int num)->int{
        string succ;
        
        sol.push_back(nodo);
        //cout<<nodo<<"\n";
        for(int i=0;i<(int)nodo.size();i++){
            char old = nodo[i];
            
            for(char j='a';j<='z';j++){
                nodo[i]=j;
                if(!vis[nodo]){
                    if(succ.size()==0)succ=nodo;
                    vis[nodo]=true;
                }
            }
            
            nodo[i]=old;
        }
        
        if(num==5000 || succ.size()==0)return num;
        return dfs(dfs,succ,num+1);
    };
    
    vis[st]=true;
    dfs(dfs,st,1);
    
    int n;
    cin>>n;
    for(int i=0;i<n;i++)cout<<sol[i]<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}