#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N;
	scanf("%d", &N);
	vector<int> dp(N+1);
	vector<bool> b(N+2, false);
	rer(x, 0, N) {
		vi v;
		if(x >= 2)
			v.push_back(dp[x / 2] ^ dp[(x + 1) / 2]);
		if(x >= 3) {
			if(x % 3 == 0)
				v.push_back(dp[x / 3]);
			else if(x % 3 == 1)
				v.push_back(dp[x / 3 + 1]);
			else
				v.push_back(dp[x / 3]);
		}
		each(i, v) b[*i] = true;
		int t = 0;
		while(b[t]) ++ t;
		each(i, v) b[*i] = false;
		dp[x] = t;
	}
	puts(dp[N] == 0 ? "B" : "A");
	return 0;
}