#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";}



void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;

	rep(i,t) solve();
}

void solve(){
	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');
	int K;
	cin>>K;
	rep(i,K){
		char a=q[i%4].front();
		q[i%4].pop();
		q[(i+1)%4].push(a);
	}
	rep(i,4){
		if(q[i].size()==1) cout<<q[i].front()<<"\n";
		else{
			cout<<q[i].front();
			q[i].pop();
			cout<<q[i].front()<<"\n";
		}
	}
}