#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) (a)<=(n)&&(n)<(b)
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll inf =1e18;

int n;
int main(){
    while(cin>>n){
        cin>>n;
        string s="bcdefghijklmnopqrs";
        do{
            if(n==1){
                cout<<'a'<<s<<'n'<<endl;
                break;
            }
            cout<<'a'<<s<<'a'<<endl;
            n--;

        }while(next_permutation(ALL(s)));


    }

    return 0;
}