#include <bits/stdc++.h>
using namespace std;
long long ncr(long long n, long long r) {
  long long i, ans = 1, k = 0;
  if (r == 0)
    return 1;
  else if (n < r)
    return 0;
  for (i = n; i >= n - r + 1; i--) {
    ans *= i;
    ans /= n - i + 1;
  }
  return ans;
}
bool visited[6] = {false};
int n = 6;
vector<int> adj[6];
void max_heapify(int a[100], int i) {
  int l, r, largest = i;
  l = 2 * i + 1;
  r = 2 * i + 2;
  if (l < n && a[l] > a[i]) largest = l;
  if (r < n && a[r] > a[l]) largest = r;
  if (largest != i) {
    int k;
    k = a[i];
    a[i] = a[largest];
    a[largest] = k;
    max_heapify(a, largest);
  }
}
int power(long long x, long long y, long long p) {
  int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool square(long long n) {
  double x;
  x = sqrt(n);
  if (x == floor(x))
    return true;
  else
    return false;
}
bool prime(long long n) {
  long long i;
  for (i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
void dfs(long long a, long long b,
         vector<pair<long long, long long>> adj[][1001], bool visited[][1001]) {
  visited[a][b] = true;
  for (auto u : adj[a][b]) {
    if (!visited[get<0>(u)][get<1>(u)]) {
      visited[get<0>(u)][get<1>(u)] = true;
      dfs(get<0>(u), get<1>(u), adj, visited);
    }
  }
}
long long modi(long long a, long long m) { return power(a, m - 2, m); }
void kmp(string s, long long pi[]) {
  int n = (int)s.length();
  pi[0] = 0;
  for (int i = 1; i < n; i++) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) j++;
    pi[i] = j;
  }
}
struct pair_hash {
  size_t operator()(const pair<int, int>& p) const noexcept {
    return hash<long long>()((((long long)p.first) << 32) |
                             ((long long)p.second));
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long i, n, j;
  cin >> n;
  for (j = 0; j < pow(2, n - 1); j++) {
    for (i = n - 1; i >= 0; i--) {
      long long k = j >> i;
      if (k & 1)
        cout << "b";
      else
        cout << "a";
    }
    cout << endl;
  }
  return 0;
}
