#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
	queue<char>que[4]={
		queue<char>({'A','E'}),
		queue<char>({'B'}),
		queue<char>({'C'}),
		queue<char>({'D'})};
	int k;
	cin>>k;
	for(int i=0;i<k;i++){
		que[(i+1)%4].push(que[i%4].front());
		que[i%4].pop();
	}
	for(int i=0;i<4;i++){
		while(que[i].size()){
			cout<<que[i].front();
			que[i].pop();
		}
		cout<<endl;
	}
}