#include <stdio.h>
#include <time.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <map> 
#include <string>
#include <vector>  
#include <iostream> 
#include <sstream> 
#include <queue>
#include <algorithm>
#include <assert.h>


using namespace std;

#define ll long long
#define PB 		push_back
#define FOR(a,start,end) 	for(int a=int(start); a<int(end); a++)
#define INF 		INT_MAX
#define SORT(a) 	sort(a.begin(),a.end()) 
#define CL(a,x) 		memset(a,x,sizeof(a))
#define REP(a,x)	for(int a=0;a<x;a++)
#define REP1(a,x)	for(int a=1;a<=x;a++)
#define MP 		make_pair



typedef vector<ll>     vi;
typedef pair<ll, ll>     pii;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vector<ll> > vvi;
typedef vector<vector<string> > vvs;
typedef vector<pair<string, string> > vss;
typedef pair<string, string> pss;
typedef pair<ll, pii> ppii;
typedef vector<ppii> vppii;
typedef vector<vector<pii> > vvii;
typedef vector<vvi> vvvi;


ll  n, k, q, d, r, g, b, z, p, a, c;
char zn;

string wa;
vi vk, va, vk1, vk2;
vector<bool> vb;
vi rozklad(ll n) {
	vi vk,vk1,vk2;
	vk.clear(); vk1.clear(); vk2.clear();
	vk1.push_back(1);
	
	while ((int)vk1.size()>0) {
		vk2.push_back(vk1.back());
		for (int i=0; i<(int)vk1.size(); i++) {
			if ((i > 0) && vk1[i] == vk1[i - 1])
				continue;
			for (int j = 0; j < 4; j++) {
				if (vk1[i] * va[j] > n)
					break;
				vk2.push_back(vk1[i] * va[j]);
				if (vk2.back() == n)
					break;
			}
			if (((int)vk2.size()>0)&&(vk2.back() == n))
				break;
		}
		vk1.swap(vk2);
		vk2.clear();
		SORT(vk1);
		if (((int)vk1.size()>0)&&(vk1.back() == n))
			break;
		if ((int)vk1.size() == 1)
			break;
	}
	
	k = vk1.back();
	
	int j = 0;
	ll m = k;
	while (m > 1) {
		while (m % va[j] == 0) {
			vk.push_back(va[j]);
			m /= va[j];
		}
		j++;
	}
	j = 1;
	while (j < (int)vk.size()) {
		if (vk[j] > 3)
			break;
		if (vk[j] * vk[j - 1] < 10) {
			vk[j - 1] *= vk[j];
			vk.erase(vk.begin() + j);
		}
		else
			j++;
	}
	vk.push_back(n - k);
	return vk;
}
vi rozklad2(ll n) {
	ll n0 = n;
	vi vk;
	vk.clear();
	ll k = 1;
	bool ok = true;
	while (ok) {
		ok = false;
		for (int a = 9; a >= 2; a--) {
			if (n%a == 0) {
				n /= a;
				vk.push_back(a);
				ok = true;
				break;
			}
		}
		if (!ok) {
			n--;
			ok = true;
		}
		if (n == 1)
			break;
	}
	for (int i = 0; i < vk.size(); i++)
		k *= vk[i];
	SORT(vk);
	int j = 1;
	while (j < (int)vk.size()) {
		if (vk[j] > 3)
			break;
		if (vk[j] * vk[j - 1] < 10) {
			vk[j - 1] *= vk[j];
			vk.erase(vk.begin() + j);
		}
		else
			j++;
	}
	vk.push_back(n0 - k);
	return vk;
}

string multi(ll n, string w) {
	vi vk;
	
	string wy;
	wy.clear();
	
	if (n > 0) {
		if ((n <= 3) && ((int)w.size() == 1)) {
			for (int i = 0; i < n; i++)
				wy += w;
		}
		else if ((n <= 2) && ((int)w.size() == 2)) {
			for (int i = 0; i < n; i++)
				wy += w;
		}
		else {
			vk = rozklad2(n);
			for (int i = 0; i < (int)vk.size() - 1; i++) {
				wy += vk[i] + '0';
				wy += '[';
			}
			wy += w;
			string wk;
			wk.assign((int)vk.size() - 1, ']');
			wy += wk;
			if (vk.back() > 1)
				wy += multi(vk.back(), w);
			else if (vk.back() == 1)
				wy += w;
		}
	}
	return wy;
}
string build(ll n0) {
	string wy;
	wy.clear();
	if (n0 == 1)
		return "AE";
	else if (n0 % 2 == 0) {
		wy = build(n0 - 1);
		wy += multi(n0 - 1, "AC");
		wy += 'A';
		wy += multi(n0, "E");
	}
	else {
		wy += "2[";
		wy += build((n0 - 1) / 2);
		wy += ']';
		wy+= multi((n0 - 1) / 2, "AC");

		string wk = multi(((n0 - 1) / 2) - 1, "CE");
		wk += 'C';
		wk+= multi((n0 - 1) / 2, "A");
		wy += multi((n0 - 1) / 2, wk);
		wy += multi((n0 - 1) / 2, "E");
		wy += multi((n0 - 1) / 2, "AC");
		wy += 'A';
		wy += multi(n0, "E");
	}
	return wy;
}
int main() {
	//freopen("c:\\wojtek\\uva\\pa\\debug\\1.in", "rt", stdin);
	//d = 1000000007;

	//while (1) {
	va = { 2,3,5,7 }; 
	cin >> n ;
	wa = build(n);
	wa += multi(n, "C");
	cout << wa << endl;


	// }

	return 0;

}