#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    int k;
    cin >> k;
    vector<queue<char>> que(4);
    rep(i,5) que[i%4].push('A'+i);
    rep(i,k){
        que[(i+1)%4].push(que[i%4].front());
        que[i%4].pop();
    }
    rep(i,4){
        while(que[i].size()){
            cout << que[i].front();
            que[i].pop();
        }
        cout << endl;
    }
    return 0;
}