#include <iostream>
#include <queue>
#include <tuple>
#include <unordered_set>

using namespace std;
using ll = long long;

int main()
{
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    // cout << fixed << setprecision(18);
    
    ll n;
    cin>>n;

    ll now = 1;
    queue<tuple<ll,ll,ll>> q;
    unordered_set<ll> visited; // 訪問済みの状態を追跡
    q.push({now,0,0});
    visited.insert(now); // 初期状態を訪問済みに設定

    while(!q.empty()){
        auto [now, s, sz] = q.front(); q.pop();
        if (now==n){
            string ans = "";
            while(sz){
                if (s & 1){
                    ans += 'B';                    
                }else{
                    ans += 'A';
                }
                s >>= 1;
                sz -= 1;
            }
            cout << ans << endl;
            return 0;
        }
        if (now * 2 + 1 <= n && visited.find(now * 2 + 1) == visited.end()){
            q.push({now * 2 + 1, s, sz + 1});
            visited.insert(now * 2 + 1);
        }
        if (now * 3 + 1 <= n && visited.find(now * 3 + 1) == visited.end()){
            q.push({now * 3 + 1, s + (1LL << sz), sz + 1});
            visited.insert(now * 3 + 1);
        }
    }
    cout << endl;   
    return 0;
}