#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int MOD=998244353;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define replr(i,l,r) for(int i=(l);i<(int)(r);i++)

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll N;
  cin>>N;
  priority_queue<ll>pq;
  map<int,pair<char,int>>memo;
  pq.push(N);
  while(pq.size()){
    ll v=pq.top();
    pq.pop();
    if((v-1)%3==0){
      ll v2=(v-1)/3;
      if(memo.find(v2)==memo.end()){
        memo[v2]=make_pair('B',v);
        pq.push(v2);
      }
    }
    if((v-1)%2==0){
      ll v2=(v-1)/2;
      if(memo.find(v2)==memo.end()){
        memo[v2]=make_pair('A',v);
        pq.push(v2);
      }
    }
  }
  ll x=1;
  while(memo.find(x)!=memo.end()){
    cout<<memo[x].first;
    x=memo[x].second;
  }
  cout<<'\n';
}