#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=101000;

int n;
string s[10100];
int main() {
	scanf("%d",&n);
	s[0]=string(10,'a');
	rep(i,1,n) {
		while (1) {
			s[i]=s[i-1];
			s[i][rnd(10)]='a'+rnd(26);
			bool val=1;
			per(j,0,i-1) {
				int dif=0;
				rep(k,0,10) dif+=s[i][k]!=s[j][k];
				if (dif==1) { val=0; break; }
			}
			if (val) break;
		}
	}
	rep(i,0,n) puts(s[i].c_str());
}