#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define popcount(x) __builtin_popcountll(x)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9+10;
const long long LINF = 4e18;
//const int MOD = 1000000007;
const int MOD = 998244353;
const double PI = 3.14159265358979323846;
template<class T, class K>bool chmax(T &a, const K b) { if (a<b) { a=b; return true; } return false; }
template<class T, class K>bool chmin(T &a, const K b) { if (b<a) { a=b; return true; } return false; }
#ifdef LOCAL_
#define debug(var)  do{cerr << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){cerr << e << endl;}
template<typename T, typename K> void view(const pair<T, K> &e){cerr << "(" << e.fi << ", " << e.se << ")" << endl;}
template<typename T> void view(const set<T> &st){ for(const auto& e : st){cerr << e << " ";} cerr << endl;}
template<typename T, typename K> void view(const map<T, K> &mp){ for(const auto& [k, v]: mp){cerr << "(" << k << ", " << v << ")" << endl;}}
template<typename T> void view(const vector<T> &v){for(const auto& e : v){cerr << e << " "; } cerr << endl;}
template<typename T> void view(const vector<vector<T>> &vv){cerr << endl;int cnt = 0;for(const auto& v : vv){cerr << cnt << "th : "; view(v); cnt++;} cerr << endl;}
#else
#define debug(...) (void(0))
#endif

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