#include <bits/stdc++.h>

using int64 = long long;

const int N = 200005;

inline std::string Str(int64 n, std::string s) {
    if (n == 0) return std::string();
    if (n == 1) return s;
    if (n <= 9) return std::string(1, char('0' + n)) + "[" + s + "]";
    return "9[" + Str(n / 9, s) + "]" + Str(n % 9, s);
}

inline void Put(int64 n, std::string s) { printf("%s", Str(n, s).data()); }

inline void Solve(int64 n) {
    // std::cerr << "Solve(" << n << ")" << std::endl;
    if (n == 1) return void(printf("AE"));
    if (n == 2) return void(printf("AAECEAE"));
    if (!(n & 1)) return Put(n, "A"), Put(n - 1, "EC"), printf("E"), Solve(n - 1);
    int64 k = n / 2;
    printf("2["), Solve(k), printf("]");
    Put(k, "AC"), printf("A");
    Put(k, Str(k, "CE") + "C" + Str(k + 1, "A"));
    Put(n, "E");
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    int64 n;
    std::cin >> n;
    Solve(n), Put(n, "C"), printf("\n");
    return 0;
}