#include <bits/stdc++.h>

using int64 = long long;

const int N = 200005;

inline void Solve(int64 n) {
    if (n == 1) return void(printf("AC"));
    if (n == 2) return void(printf("AACECAC"));
    if (!(n & 1)) return printf("%lld[A]%lld[CE]C", n, n - 1), Solve(n - 1);
    int k = n / 2;
    printf("2["), Solve(k), printf("]");
    printf("%lld[AE]A", k);
    printf("%lld[%lld[EC]E%lld[A]]", k, k, k + 1);
    printf("%lld[C]", n);
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    int64 n;
    std::cin >> n;
    Solve(n), printf("%lld[E]\n", n);
    return 0;
}