#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;
	}
	int len=n/2;
	if(n&1){
		string ans=solve(n/2);
		sum+="2[";
		sum+=ans;
		sum+=']';
		int now=len;
		while(now){
			if(now<=9)
				sum=sum+char(now+'0')+"[AC]";
			else
				sum=sum+"9[AC]";
			now-=min(9,now);
		}
		sum+='A';
		string s2="";
		now=len;
		while(now){
			if(now<=9)
				s2=s2+char(now+'0')+"[CE]";
			else
				s2=s2+"9[CE]";
			now-=min(9,now);
		}
		s2+='C';
		now=len+1;
		while(now){
			if(now<=9)
				s2=s2+char(now+'0')+"A";
			else
				s2=s2+"9A";
			now-=min(9,now);
		}
		now=len;
		while(now){
			if(now<=9)
				sum=sum+char(now+'0')+'['+s2+']';
			else
				sum=sum+"9["+s2+']';
			now-=min(9,now);
		}
	}
	else{
		sum=solve(n-1);
		int now=n-1;
		while(now){
			if(now<=9)
				sum=sum+char(now+'0')+"[AC]";
			else
				sum=sum+"9[AC]";
			now-=min(9,now);
		}
		sum+='A';
	}
	int now=n;
	while(now){
		if(now<=9)
			sum=sum+char(now+'0')+"E";
		else
			sum=sum+"9E";
		now-=min(9,now);
	}
	return sum;
}
int main(){
	n=read();
	cout<<solve(n)<<n<<"C";
	return 0;
}