#include<iostream>
#include<cassert>
using namespace std;
int memo[50][50][50][50];
bool dfs(int ev,int od,int p0,int p1,int cur,int n,string S)
{
	assert(ev+od==p0+p1);
	if(ev+od==0)
	{
		if((cur==1)==(S=="Odd"))
		{//Alice win
			return n%2==0;
		}
		else
		{
			return n%2==1;
		}
	}
	if(memo[ev][od][p0][p1]!=0)return memo[ev][od][p0][p1]>0;
	bool win=false;
	if(ev>0)
	{
		if(p0>0)
		{
			if(!dfs(ev-1,od,p0-1,p1,cur,n,S))win=true;
		}
		if(p1>0)
		{
			if(!dfs(ev-1,od,p0,p1-1,cur,n,S))win=true;
		}
	}
	if(od>0)
	{
		if(p0>0)
		{
			if(!dfs(ev,od-1,p0-1,p1,cur,n,S))win=true;
		}
		if(p1>0)
		{
			if(!dfs(ev,od-1,p0,p1-1,cur^1,n,S))win=true;
		}
	}
	memo[ev][od][p0][p1]=win?1:-1;
	return win;
}
bool naive(int n,string S)
{
	int ev=0,od=0,p0=0,p1=0;
	for(int i=1;i<=n;i++)
	{
		if(i%2==1)od++;
		else ev++;
	}
	for(int i=0;i<=n-1;i++)
	{
		if((i&n-1)==i)p1++;
		else p0++;
	}
	for(int i=0;i<=ev;i++)for(int j=0;j<=od;j++)for(int k=0;k<=p0;k++)for(int l=0;l<=p1;l++)memo[i][j][k][l]=0;
	return dfs(ev,od,p0,p1,0,n,S);
}
bool f(long N,string S)
{
	int pc=__builtin_popcountll(N-1);
	if(N==1||__builtin_popcountll(N+2)==1)
	{
		return S!="Even";
	}
	else
	{
		return S!="Odd";
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	for(int n=1;n<=30;n++)
	{
		//cout<<n<<" "<<naive(n,"Even")<<" "<<naive(n,"Odd")<<endl;
		//assert(naive(n,"Even")==f(n,"Even"));
		//assert(naive(n,"Odd")==f(n,"Odd"));
	}
	int T;cin>>T;
	for(;T--;)
	{
		long N;
		string S;
		cin>>N>>S;
		cout<<(f(N,S)?"Alice\n":"Bob\n");
	}
}