#include <bits/stdc++.h>
#define int long long

#define rep(i, a, b) for (int i = (a); i <= (b); i ++)
#define dep(i, a, b) for (int i = (a); i >= (b); i --)

using namespace std;

string print(string a, int len) { // 卡长度 
  if ( a.empty() || !len ) return "";
  if ( len == 1 ) return a;
  string tmp;
  tmp.push_back('0' + len);
  if ( len <= 9 ) return tmp + "[" + a + "]";
  return "9[" + print(a, len / 9) + "]" + print(a, len % 9);
}

string sol(int len) {
  if ( len == 1 ) return "A";
  if ( len == 2 ) return "AEACA";
  int mid = (len >> 1);
  if ( len & 1 ) return print(sol(mid), 2) + print("FD", len - 1) + 
    print(print("BD", mid) + "B" + print("F", mid), mid) + print("B", mid) + "A";
  // 对菱形处理，行内 log 次，行与行 log 次
  else return sol(len - 1) + print("E", len - 1) + print("AC", len - 1) + "A";
}

signed main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int n; cin >> n;
  cout << sol(n) + print("E", n) + print("C", n);
  // 从左下角开始，最后再走完最上面的虚边 
  return 0;
}