//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
//#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 1000000007
#define eps 0.00000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
	if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
	*pp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pp-buf2,stdout);
	pp=buf2;
}
inline int read(void) {
	int w=1;
	register int x(0);register char c(getchar());
	while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return w*x;
}
void write(int x) {
	if(x<0) pc('-'),x=-x;
	static int sta[20];
	int top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while(x);
	while(top) pc(sta[--top]+48);
}
void we(int x) {
	write(x);
	pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
int N,la;
char s[20];
std::unordered_set<LL> vi;
bool chk(void) {
	LL sq=0;
	for(int i=1;i<=10;i++) sq=(sq*137+s[i]-'a'+19)%10000000000000007ll;
	if(vi.find(sq)==vi.end()) return 1;
	return 0;
}
void ad(void) {
	for(int i=1;i<=10;i++) {
		char tp=s[i];
		for(int j=0;j<26;j++) {
			s[i]=j+'a';
			LL sq=0;
			for(int k=1;k<=10;k++) sq=(sq*137+s[k]-'a'+19)%10000000000000007ll;
			vi.insert(sq);
		}
		s[i]=tp;
	}
}
signed main(void) {
    //freopen("m.in","r",stdin);
    //freopen("m.out","w",stdout);
	scanf("%d",&N);
	for(int i=1;i<=10;i++) s[i]=rand()%26+'a'; 
	printf("%s\n",s+1);
	N--;
	while(N--) {
		bool ff=0;
		int op,v;
		while(1) {
			op=rand()%10+1;
			while(op==la) op=rand()%10+1;
			v=rand()%26;
			while(s[op]==v+'a') v=rand()%26;
			char tp=s[op];
			s[op]=v+'a';
			if(chk()) {
				s[op]=tp;
				break;
			}
			s[op]=tp;
		} 
		ad();
		s[op]=v+'a';
		la=op;
		printf("%s\n",s+1);
	}
    return 0;
}