#include<bits/stdc++.h>
using namespace std;
#define ll long long
inline string solve1(ll n,string op){//复制 op n 遍 
	string ret;
	if(n==1){
		ret+=op;
		return ret;
	}
	for(ll i=9;i>=2;i--){
		if(i<=n){
			ret+=(i+'0');
			ret+='[';
			ret+=solve1(n/i,op);
			ret+=']'; 
			for(int j=1;j<=n%i;j++) ret+=op;
			break;
		}
	}
	return ret;
}
inline string solve(ll n){
	string ret;
	if(n==1){
		ret+="AE";
		return ret;
	}
	if(n&1ll){
		ret+=solve1(2ll,solve(n/2ll));
		ret+=solve1(n/2ll,"AC");
		ret+="A";
		string now;
		now+="C";
		now+=solve1(n/2ll,"EC");
		now+=solve1(n/2ll,"A");
		ret+=solve1(n/2ll,now);
		ret+=solve1(n,"E");
	}
	else{
		ret+=solve1(n,"A");
		ret+=solve1(n-1,"EC");
		ret+="E";
		ret+=solve(n-1);
	}
	return ret;
}
ll n;
int main(){
	cin>>n;
	string ans=solve(n);
	ans+=solve1(n,"C");
	cout<<ans;
	return 0;
}