#include <bits/stdc++.h>
#define int long long
using namespace std;

string ksm(string s, int b){
	if(!b) return "";
	if(b == 1) return s;
	if(b <= 9) {
		string res;
		res += b + '0';
		if(s.length() == 1) return res + s;
		else return res + "[" + s + "]";
	}
	return "9[" + ksm(s, b / 9) + "]" + ksm(s, b % 9);
}
void solve(int n, bool fg = false) {
	if(n == 1) {
		cout << "AE";
		if(!fg) cout << "C";
		return ;
	}
	if(n == 2) {
		cout << "AEACAEE";
		if(!fg) cout << "CC";
		return ;
	}
	cout << "2[", solve((n - 1) / 2, 1), cout << ']';
	cout << ksm("AC", (n - 1) / 2), cout << 'A';
	string s = ksm("CE", (n - 1) / 2) + "C" + ksm("A", (n - 1) / 2 + 1);
	cout << ksm(s, (n - 1) / 2);
	if(n & 1) cout << ksm("E", n);
	else {
		cout <<'A', cout << ksm("E", n - 1) + ksm("CA", n - 2), cout << 'C';
		cout << ksm("E", n - 1), cout << "AE";
	} 
	if(!fg) cout << ksm("C", n);
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	
	int n;
	cin >> n;
	solve(n);
	return 0;
}