#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define reps(i, s, e) for (ll i = s; i <= e; ++i)
#define rrep(i, n) for (ll i = n - 1; 0 <= i; --i)
#define all(v) v.begin(), v.end()
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
using ll = long long;
using ld = long double;
using cp = complex<ld>;
using pa = pair<ll, ll>;
using tup = tuple<ll, ll, ll>;
using vp = vector<pair<ll, ll> >;
using vtup = vector<tuple<ll, ll, ll> >;
using st = string;
using vs = vector<string>;
using vc = vector<char>;
using vvi = vector<vector<ll> >;
using vvc = vector<vector<char> >;
using vi = vector<ll>;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
const ll INF = (1LL << 60);

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  vector<deque<char> > que;
  deque<char> q1 = {'A', 'E'};
  deque<char> q2 = {'B'};
  deque<char> q3 = {'C'};
  deque<char> q4 = {'D'};
  que.push_back(q1);
  que.push_back(q2);
  que.push_back(q3);
  que.push_back(q4);

  ll k;
  cin >> k;

  ll i = 0;
  while (k--) {
    if (que[i%4].size() != 0) {
      ll cur = que[i%4].front();
      que[i%4].pop_front();
      que[(i+1)%4].push_back(cur);
      i++;
    }
  }

  rep(i, 4) {
    while(que[i].size() != 0) {
      cout << que[i].front();
      que[i].pop_front();
    }
    cout << endl;
  }
}