#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define M_PI 3.14159265358979323846 using namespace std; //conversion //------------------------------------------ inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } inline int readInt() { int x; scanf("%d", &x); return x; } //typedef //------------------------------------------ typedef vector VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef pair TIII; typedef long long LL; typedef unsigned long long ULL; typedef vector VLL; typedef vector VVLL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define SQ(a) ((a)*(a)) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,s,n) for(int i=s;i<(int)n;++i) #define REP(i,n) FOR(i,0,n) #define MOD 1000000007 vector v; map mp; void dfs(int d, string s){v.push_back(s); if(d==4){ return ; } for(int i=0; i<26; ++i){ dfs(d+1, s + (char)('a'+i)); } } int main() { //cout << fixed << setprecision(8); int N = readInt(); dfs(0, ""); int cnt=0; int zure=0; while(cnt != N-1){ if(mp.find("a"+v[cnt]+"a") != mp.end()){ while(mp.find("a"+v[cnt+zure]+"a") != mp.end()) zure++; } cout << 'a' << v[cnt+zure] << 'a' << endl; mp["a"+v[cnt+zure]+"a"]++; cnt++; } cout << v[cnt] << "aaaan" << endl; return 0; }