#include<bits/stdc++.h>
using i64 = long long;
std::string copy(std::string s, i64 c) {
	if (c == 0) return std::string();
	if (c < 10) return std::to_string(c) + "[" + s + "]";
	return copy(s, c % 9) + "9[" + copy(s, c / 9) + "]";
}
std::string solve(i64 n) {
	if (n == 1) return "AE";
	if (n == 2) return "AEACAEE";
	if (n & 1) {
		std::string s = "2[" + solve(n / 2) + "]" 
		+ copy("AC", n / 2) 
		+ copy("CA", n / 2 - 1) + "C"
		+ copy(copy("E", n / 2) + copy("CA", n / 2 - 1) + "C", n / 2 - 1)
		+ copy("A", n / 2 + 1) + copy("ECEA", n / 2)
		+ copy("E", n / 2 + 1);
		return s;
	}
	std::string s = solve(n - 1)
	+ copy("AC", n - 1) + "A" + copy("E", n);
	return s;
}
int main() {
	i64 n; scanf("%lld", &n);
	std::cout << solve(n) + copy("C", n);
	return 0;
}