/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI 3.14159265359
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define BIT(x,i) (1&((x)>>(i)))
#define MASK(x) (1LL<<(x))
#define task "tnc"  
typedef long long ll;
const ll INF=1e18;
const int maxn=1e6+5;
const int mod=1e9+7;
const int mo=998244353;
using pi=pair<ll,ll>;
using vi=vector<ll>;
using pii=pair<pair<ll,ll>,ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

string mul(int x,string s){
	vector<int>q;
	while(x>0){
		q.pb(x%9);
		x/=9;
	}
	string ans;
	for(int i=0;i<q.size();i++){
		if(q[i]!=0){
			ans+=char('0'+q[i]);
			ans+="["+s+"]";
		}
		if(i!=len(q)-1){
			ans+="[9";
		}
	}
	for(int i=1;i<q.size();i++){
		ans+="]";
	}
	return ans;
}
vector<string>kq;
void recur(int n){
	if(n==1){
		kq.pb("A");
	}
	else if(n==2){
		kq.pb("AEACA");
	}
	else if(n==3){
		kq.pb("AEAEACCAEACA");
	}
	else if(n%2==1){
		int k=n/2;
		string s1=mul(k+1,"A");
		string s2=mul(k,"EC")+"E";
		kq.pb(mul(k,s1+s2)+"A");
		kq.pb(mul(k,"EA"));
		kq.pb("2[");
		kq.pb(mul(k,"C"));
		recur(k);
		kq.pb("]");
	}
	else{
		kq.pb("A");
		kq.pb(mul(n-1,"EA"));
		kq.pb(mul(n-1,"C"));
		recur(n-1);
	}
}
signed main()
{
	cin.tie(0),cout.tie(0)->sync_with_stdio(0);
    //freopen(task".inp" , "r" , stdin);
    //freopen(task".out" , "w" , stdout);
    int n;
    cin>>n;
    kq.pb(mul(n,"C"));
    recur(n);
    kq.pb(mul(n,"E"));
    for(auto v:kq){
    	cout<<v;
    }
    

    return 0;
}