1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include<bits/stdc++.h>
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define pp pop_back
#define eb emplace_back
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int N=2e5+5, INF=1e9+5, mod=1e9+7;
vector<char> ans;
vector<char> gen2(ll k, vector<char> V){
	vector<char> res;
	int i=0;
	while(k>0){
		if(k%9>1){
			res.pb('0'+k%9);
			if(V.size()>1)res.pb('[');
			for(char c:V)res.pb(c);
			if(V.size()>1)res.pb(']');
		}
		if(k%9==1){
			for(char c:V)res.pb(c);
		}
		if(k>=9){
			res.pb('9');
			res.pb('[');
			i++;
		}
		k/=9;
	}
	for(int j=0; j<i; j++)res.pb(']');
	return res;
}
void gen(ll k, vector<char> V){
	vector<char> res=gen2(k, V);
	for(char c:res)ans.pb(c);
}
void solve(ll n){
	if(n==1){
		ans.pb('C');
		ans.pb('A');
		return;
	}
	if(n==2){
		ans.pb('C');
		ans.pb('A');
		ans.pb('C');
		ans.pb('E');
		ans.pb('C');
		ans.pb('A');
		ans.pb('A');
		return;
	}
	if(n&1){
		ans.pb('2');
		ans.pb('[');
		solve(n/2);
		ans.pb(']');
		gen(n/2+1, {'C', 'E'});
		gen(n/2, {'A', 'E'});
		gen(n/2-1, {'C', 'E'});
		ans.pb('C');
		vector<char> V2=gen2(n/2-1, {'B', 'F'}), V3=gen2(n/2-1, {'D'});
		for(char c:V3)V2.pb(c);
		V2.pb('C');
		gen(n/2, V2);
		gen(n, {'A'});
	}
	else{
		ans.pb('C');
		solve(n-1);
		gen(n-1, {'E'});
		gen(n-1, {'A', 'C'});
		ans.pb('A');
	}
}
int main(){
	//BOOST;
	ll n;
	cin>>n;
	solve(n);
	gen(n, {'E'});
	deb(ans.size());
	//assert(ans.size()<=107000);
	for(char c:ans)cout<<c;
}