#include <bits/stdc++.h>
using namespace std;
/*/
#include <atcoder/all>
using namespace atcoder;
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//*/
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define ALL(x) (x).begin(),(x).end()
#define dbgv(x); for(auto now : x) cout << now << " "; cout << endl;
//using P = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
//*/
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; }
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vint;
random_device rnd;
mt19937 rng(rnd());

void solve(){
  ll n;
  cin >> n;
  string ans = "";
  set<ll> st;
  bool ok = false;
  auto f = [&](auto f,ll x)->void{
    if(x==1){
      ok = true;
      return;
    }
    if(st.find(x) != st.end()) return;
    st.insert(x);
    if((x-1)%2 == 0){
      f(f,(x-1)/2);
      if(ok){
        ans.push_back('A');
        return;
      }
    }
    if((x-1)%3 == 0){
      f(f,(x-1)/3);
      if(ok){
        ans.push_back('B');
        return;
      }
    }
  };
  f(f,n);
  cout << ans << endl;
}


int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1; //cin >> t;
  rep(testcases,t) solve();
}