#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline ll read(){
	char ch=getchar();
	ll f=1,x=0;
	while(ch<'0'||ch>'9'){
		if(ch=='-')
			f=-f;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=x*10+ch-'0';
		ch=getchar();
	}
	return x*f;
}
inline void work(int k){
	if(k<0){
		putchar('-');
		k=-k;
	}
	if(k>9)
		work(k/10);
	putchar(k%10+'0');
}
/*
当n为奇数时,可以划分为两个n/2的三角形带一个菱形
分别解决,递归即可
n为偶数时
*/
ll n;
string solve(ll n){
	string sum="";
	if(n==1){
		sum="AE";
		return sum;
	}
	string s1="",s4="",s3="";
	ll len=n/2,now2=n,now=len,now1=len+1;
	while(now){
		s1=(char)(now%10+'0')+s1;
		now/=10;
	}
	while(now1){
		s3=(char)(now1%10+'0')+s3;
		now1/=10;
	}
	while(now2){
		s4=(char)(now2%10+'0')+s4;
		now2/=10;
	}
	now2=n,now=len,now1=len+1;
	if(n&1){
		string ans=solve(n/2);
		sum+="2[";
		sum+=ans;
		sum+=']';
		if(now!=1)
			sum=sum+s1+"[AC]";
		else
			sum+="AC";
		sum+='A';
		string s2="";
		if(now!=1)
			s2=s1+"[CE]";
		else
			s2="CE";
		s2+='C';
		if(now1!=1)
			s2=s2+s3+'A';
		else
			s2=s2+'A';
		if(now!=1)
			sum=sum+s1+'['+s2+']';
		else
			sum=sum+s2;
		if(now2!=1)
			sum=sum+s4+'E';
		else
			sum=sum+'E';
	}
	else{
		string ans=solve(n-1);
		if(now2!=1)
			sum=ans+s4+"[AC]";
		else
			sum=ans+"AC";
		sum+='A';
		if(now2!=1)
			sum=sum+s4+'E';
		else
			sum=sum+'E';
	}
	return sum;
}
int main(){
	n=read();
	cout<<solve(n)<<n<<"C";
	return 0;
}