#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;
stack<int> q;
void add(int now,string s1,string &sum){
	int num=0;
	while(now>9){
		q.emplace(now/9);
		now/=9;
	}
	q.emplace(now);
	while(!q.empty()){
		sum=sum+(char)(q.top()+'0')+"[";
		q.pop();
	}
	sum+=s1;
	while(num--){
		sum+=']';
	}
}
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+=']';
		add(len,"AC",sum);
		sum+='A';
		string s2="";
		add(len,"CE",s2);
		s2+='C';
		add(len+1,"A",s2);
		add(len,s2,sum);
	}
	else{
		sum=solve(n-1);
		add(n-1,"AC",sum);
		sum+='A';
	}
	add(n,"E",sum);
	return sum;
}
int main(){
	n=read();
	string ans=solve(n);
	add(n,"C",ans);
	cout<<ans<<"\n";
	return 0;
}