#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

int n;
vector<int>A;


int main(){
	int n;
	cin >> n;

	string s = "bcdefghijklmopqrstuvwxyz";
	int sz = s.size();

	int cnt = 0;
	rep(i, 0, sz)rep(j, 0, sz)rep(k, 0, sz)rep(l, 0, sz) {
		if (cnt == n - 1) {
			cout << "an" << endl;
			return 0;
		}
		else {
			cout << "a" << s[i] << s[j] << s[k] << s[l] << "a" << endl;
			cnt++;
		}
	}


	

	return 0;
}