#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main()
{
	long long n;
	cin >> n;
	string ans;
	map<long long, long long> mp;
	mp[1] = 1;
	auto dfs = [&](auto f, long long now) -> long long
	{
		if (mp.find(now) != mp.end()) return mp[now];
		long long tmp = now / 2;
		if (tmp * 2 + 1 == now)
		{
			if (f(f, tmp) > 0)
			{
				return mp[now] = tmp;
			}
		}
		tmp = now / 3;
		if (tmp * 3 + 1 == now)
		{
			if (f(f, tmp) > 0)
			{
				return mp[now] = tmp;
			}
		}
		return mp[now] = 0;
	};
	dfs(dfs, n);
	while (n > 1)
	{
		long long v = mp[n];
		if (v * 2 + 1 == n)
		{
			ans.push_back('A');
		}
		else
		{
			ans.push_back('B');
		}
		n = v;
	}
	reverse(ans.begin(), ans.end());
	cout << ans << endl;
}