#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
map<vector<int>,bool> M;

bool win(vector<int> V) {
	sort(V.begin(),V.end());
	if(M.count(V)) return M[V];
	
	bool w=false;
	int pre=1,i,j;
	FOR(i,V.size()) if(V[i]!=pre) {
		vector<int> V2;
		FOR(j,V.size()) if(i!=j) V2.push_back(V[j]);
		int xx=V[i];
		if((xx+1)/2>1) V2.push_back((xx+1)/2);
		if((xx+0)/2>1) V2.push_back(xx/2);
		if(win(V2)==false) w=true;
		
		V2.clear();
		FOR(j,V.size()) if(i!=j) V2.push_back(V[j]);
		xx=V[i];
		if((xx+2)/3>1) V2.push_back((xx+2)/3);
		if((xx+1)/3>1) V2.push_back((xx+1)/3);
		if((xx+0)/3>1) V2.push_back(xx/3);
		if(win(V2)==false) w=true;
		
		
		if(w) break;
		pre=V[i];
	}
	
	return M[V]=w;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	vector<int> V;
	V.push_back(N);
	
	if(win(V)) cout<<"A"<<endl;
	else cout<<"B"<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}