#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <sstream>
#include <complex>
#include <ctime>
#include <cassert>
#include <functional>

using namespace std;

typedef long long ll;
typedef vector<int> VI;
typedef pair<int,int> PII;

#define REP(i,s,t) for(int i=(s);i<(t);i++)
#define FILL(x,v) memset(x,v,sizeof(x))

const int INF = (int)1E9;
#define MAXN 5000

char chr(int x) {
  return 'a' + x;
}

string str(int a, int b, VI &chs) {
  string res = "";
  res += chr(a);
  res += chr(b);
  for (auto &c: chs) res += chr(c);
  return res;
}

int main() {
  int a = 0, b = 0;
  VI chs(8, 25);
  vector<string> res;
  res.push_back(str(a, b, chs));
  REP(cl,0,26) {
    REP(cr,0,25) {
      REP(i,0,8) {
        chs[i] = (chs[i] + 1) % 26;
        res.push_back(str(a, b, chs));
      }
    }
    b = (b + 1) % 26;
    res.push_back(str(a, b, chs));
    a = (a + 1) % 26;
    res.push_back(str(a, b, chs));
  }
  int n;
  cin >> n;
  REP(i,0,n) cout << res[i] << endl;
  return 0;
}