#include <bits/stdc++.h>
using namespace std;
const int len[] = {11,13,17,19,23};
int n; char ans[5005][5];
char nxt(int now,int idx){
	return now==len[idx]-1 ? 'a' : 'a'+now+1;
}
void put(int idx){
	for(int al=0;al<5;al++) putchar(ans[idx][al]); putchar('\n');
}
int main(){
	scanf("%d",&n);
	for(int al=0;al<5;al++) ans[0][al] = 'a';
	for(int al=1;al<n;al++)for(int be=0;be<5;be++)
		ans[al][be] = (al%5==be ? nxt(ans[al-1][be]-'a',be) : ans[al-1][be]);
	for(int al=0;al<n;al++)for(int be=0;be<al-1;be++){
		int dif = 0;
		for(int ga=0;ga<5;ga++)if(ans[al][ga]!=ans[be][ga]) ++dif;
		if(dif<1) {printf("wrong on %d and %d\n",be,al); put(be),put(al); put(al-1);return 0;}
	}
	for(int al=0;al<n;al++) put(al);
	return 0;
}