博奕題，狀態壓縮 DP 試過可以省 0.8 秒
//====================================================================||
// Name : The Game of 31.cpp ||
// Date : Jun 2, 2013 12:18:21 AM ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int dp\[1<<24\];
int lose(int x){
int mul=0;
int ans=0;
for(int i=0;i<24;i++){
if(!(i%4))mul++;
if(1&(x>>i))ans+=mul;
}
return ans;
}
bool dfs(int x,int p,int depth){
if(dp\[x\]!=0){
if(dp\[x\]==p)return true;
return false;
}
// int tmp;
/\*if((tmp=lose(x))>31){
// dp\[x\]=3-p;
for(int i=23,j=6;i>=0;i--){
if(1&(x>>i))
printf("%d",j);
if(!(i%4))j--;
}printf(" %d %c %d\\n",tmp,(p==1)?'A':'B',depth);
return false;
}\*/
// for(int i=23,j=6;i>=0;i--){
// if(1&(x>>i))
// printf("%d",j);
// if(!(i%4))j--;
// }printf(" %c %d\\n",(p==1)?'A':'B',depth);
for(int i=0;i<24;i+=4){
int j;
for(j=i;j<i+4;j++){
if(!((x>>j)&1))break;
}
if(j==i+4)continue;
int add=(1<<j);
if(lose(x|add)<=31&&!dfs(x|add,3-p,depth+1)){
dp\[x\]=p;
return true;
}
}
// dp\[x\]=3-x;
return false;
}
int main() {
ios\_base::sync\_with\_stdio(0);
char str\[100\];
//pre();
while(~scanf("%s",str)){
Set(dp,0);
int len=strlen(str);
int now=0;
int pl;
for(int i=0;i<len;i++){
int n=str\[i\]-'0';n--;
n\*=4;
int tmp=1<<n;
int j;
for(j=n;j<n+4;j++){
if(1&(now>>j)){
tmp<<=1;
}else break;
}
if(j==n+4)continue;
now|=tmp;
}
// for(int i=23;i>=0;i--){
// printf("%d",((now>>i)&1)?1:0);
// }Pln();
pl=(len&1)?2:1;
if(dfs(now,pl,0)){//(dp\[now\]==1)?'A':'B'
printf("%s %c\\n",str,(pl==1)?'A':'B');
}else printf("%s %c\\n",str,(pl==1)?'B':'A');
// if(dp\[now\]==1){//(dp\[now\]==1)?'A':'B'
// printf("%s %c\\n",str,'A');
// }else printf("%s %c\\n",str,'B');
}
}