#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#include <sstream>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
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; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  vector<queue<char>> Q(4);
  int K; cin >> K;
  Q[0].push('A');
  Q[1].push('B');
  Q[2].push('C');
  Q[3].push('D');
  Q[0].push('E');
  rep(k,K){
    auto t = Q[k%4].front(); Q[k%4].pop();
    Q[(k+1)%4].push(t);
  }
  rep(i,4){
    while(!Q[i].empty()){
      cout << Q[i].front();
      Q[i].pop();
    }
    cout << endl;
  }
  return 0;
}