#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long n; cin >> n;
	vector<char>a;
	long long now = n;
	auto dfs = [&](auto &&self)->bool {
		if (1 == now) return true;
		if (now > n)return false;
		if (1 == now % 2) {
			now = (now - 1) / 2;
			a.push_back('A');
			bool ret = self(self);
			if (ret)return true;
			a.pop_back();
			now = now * 2 + 1;
		}
		if (1 == now % 3) {
			now = (now - 1) / 3;
			a.push_back('B');
			bool ret = self(self);
			if (ret)return true;
			a.pop_back();
			now = now * 3 + 1;
		}
		return false;
	};
	dfs(dfs);
	reverse(all(a));
	rep(i, a.size())cout << a[i];
	cout << endl;
	return 0;
}