#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
bool dp[1<<20];
bool solve(long long N)
{
	if(N%10!=0)return true;
	N/=10;
	long long lose=0;
	const long long C=0;
	if(N>=C)
	{
		lose=C+(N-C)/90000*90000;
	}
	dp[0]=false;
	for(long long t=lose+1;t<=N;t++)
	{
		long long u=t;
		int c=0;
		while(u)c+=u%10,u/=10;
		c/=10;
		bool fn=false;
		for(long long v=1;v<=c;v++)if(t-v>=lose&&!dp[t-v-lose])
		{
			fn=true;
			break;
		}
		dp[t-lose]=fn;
	}
	return dp[N-lose];
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T;cin>>T;
	for(;T--;)
	{
		long long N;
		cin>>N;
		cout<<(solve(N)?"Algosia":"Bajtek")<<"\n";
	}
}