#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
#define eb emplace_back
#define rng(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,b) rng(i,0,b)
using ll=long long;
using P=pair<int,int>;
#define tct template<class t>
#define tctu template<class t,class u>
tct using vc=vector<t>;
tctu bool chmax(t&a,u b){if(a<b){a=b;return 1;}return 0;}
tctu bool chmin(t&a,u b){if(a>b){a=b;return 1;}return 0;}

int dp[1000010];

ll k(ll a){
	ll ret=0;
	while(a>0){
		ret+=a%10;
		a/=10;
	}
	return ret;
}constexpr int B = 54000;
	
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int T;
	cin>>T;
	rep(t,T){
		ll n;
		cin>>n;
		ll r=n/B*B;
		dp[0]=1;
		for(ll i=n-n%B+1;i<=n;i++){
			if(i%10!=0){
				dp[i-r]=0;
				continue;
			}
			ll x=k(i);
			dp[i-r]=1;
			for(ll j=i-1;j>=i-x;j--){
				if(dp[j-r]==1){ dp[i-r]=0; break; }
			}
		}
		if(dp[n-r])cout<<"Bajtek"<<endl;
		else cout<<"Algosia"<<endl;
	}
	
	/*int pre_B=0;
	dp[0]=1;
	for(int i=1;i<=100000000;i++){
		//int x=k(i*10)/10;
		int x=k(i);
		int sum=0;
		for(int j=i-x;j<=i-1;j++){
			sum+=dp[j];
		}
		if(sum>0)dp[i]=0;
		else dp[i]=1;
		if(dp[i]>0){
			//cerr<<i<<" "<<i-pre_B<<endl;
			pre_B=i;
		}
		if(i%18000==0){
			if(dp[i]==0)cerr<<"NG:"<<i<<endl; //cerr<<dp[i]<<endl;
		}
		if(i%1000000==0)cerr<<"OK:<"<<i<<endl;
			
	}*/
}