#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ql = queue<ll>;
using sl = set<ll>;
using vl = vector<ll>;
using msl = multiset<ll>;
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)
#define rep(i, n) for(ll i = 0; i < ((ll)n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
template <typename T> void print(T &d) {
    for(auto &i : d)
        cout << i << " ";
    if(d.size())
        cout << endl;
}
map<ll,string> mp;
string f(ll x){
    if(mp.count(x))return mp[x];
    if(x==1)return mp[x] = "";
    if(x%2){
        if(f(x/2)!="!")return mp[x] = f(x/2)+"A";
    }
    if((x%3) == 1){
        if(f(x/3)!="!")return mp[x] = f(x/3)+"B";
    }
    return mp[x] = "!";
}
void solve() {
    ll n;cin>>n;
    cout<<f(n)<<endl;
}

int main() {
    // { // 前処理　MAX=1e6
    //     rep1(i, MAX) fac[i] = i * fac[i - 1];
    //     ifac[MAX] = fac[MAX].inv();
    //     for(ll i = MAX; i >= 1; i--)
    //         ifac[i - 1] = ifac[i] * (i);
    // }
    ll t;
    t = 1;
    // cin >> t;
    rep(_, t) solve();
}