#include <iostream>
#include <cstdio>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)

int dp[110];

int grundy(int x){
	if(x == 1)return 0;
	if(dp[x] != -1)return dp[x];

	set<int> s;
	if(x % 2 == 0) s.insert(dp[x / 2] ^ dp[x / 2]);
	if(x % 2 == 1) s.insert(dp[x / 2] ^ dp[x / 2 + 1]);
	if(x % 3 == 0) s.insert(dp[x / 3] ^ dp[x / 3] ^ dp[x / 3]);
	if(x % 3 == 1) s.insert(dp[x / 3] ^ dp[x / 3] ^ dp[x / 3 + 1]);
	if(x % 3 == 2) s.insert(dp[x / 3] ^ dp[x / 3 + 1] ^ dp[x / 3 + 1]);

	int res = 0;
	while(s.count(res)) res++;
	return dp[x] = res;
}

int main(void){
	rep(i, 110) dp[i] = -1;
	int n; cin >> n;

	if(grundy(n) == 0){
		printf("B\n");
	}else{
		printf("A\n");
	}
	return 0;
}