#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    vector<queue<char>> v(4);
    v[0].push('A');
    v[1].push('B');
    v[2].push('C');
    v[3].push('D');
    v[0].push('E');

    int K;
    char c;
    cin >> K;
    for (int i=0; i<K; i++){
        c = v[i%4].front();
        v[i%4].pop();
        v[(i+1)%4].push(c);
    }

    for (int i=0; i<4; i++){
        while(!v[i].empty()){
            c = v[i].front();
            cout << c;
            v[i].pop();
        }
        cout << endl;
    }

    return 0;
}