#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    ll N; cin >> N;

    map<ll, ll> mp;
    mp[1] = 0;
    queue<ll> Q;
    Q.push(1);
    while(!Q.empty()){
        ll x = Q.front();
        Q.pop();
        if(2 * x + 1 <= N && mp.find(2 * x + 1) == mp.end()){
            mp[2 * x + 1] = x;
            Q.push(2 * x + 1);
        }
        if(3 * x + 1 <= N && mp.find(3 * x + 1) == mp.end()){
            mp[3 * x + 1] = x;
            Q.push(3 * x + 1);
        }
    }

    if(mp.find(N) == mp.end()){
        cout << endl;
    }
    else{
        vector<char> ans;
        ll now = N;
        while(now != 1){
            if((now - 1) % 2 == 0 && mp[now] == (now - 1) / 2){
                ans.push_back('A');
                now = (now - 1) / 2;
            }
            else if((now - 1) % 3 == 0 && mp[now] == (now - 1) / 3){
                ans.push_back('B');
                now = (now - 1) / 3;
            }
            else {
                cout << endl;
                return 0;
            }
        }
        reverse(all(ans));
        rep(i, (int)ans.size()) cout << ans[i];
        cout << endl;
    }
}