#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T> &x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int i=1,len=x.size();i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<endl;
}
template<typename T,typename ... S>
void debug(T x,S...y){
	cerr<<x<<' ',debug(y...);
}
int count(ll n){
	int ans=0;
	for(;n;n/=10)ans+=n%10;
	return ans;
}
ll nex(ll n,int s=0){
	for(ll i=n+10;;i+=10){
		if(i-count(i)-s>n)return i;
	}
	return -1;
}
const int N=20,M=200;
int T,his[N][M][M];
ll n,pw[N];
int nex(int d,int s,int i){
	int las=i;
	if(~his[d][s][las])return his[d][s][las];
	if(d<3){
		for(;i<pw[d+1];i=nex(i,s));
		return his[d][s][las]=i-pw[d+1];
	}
	for(;i/pw[d]<9;){
		int x=nex(d-1,s+i/pw[d],i%pw[d]);
		i+=x-i%pw[d]+pw[d];
	}
	return his[d][s][las]=nex(d-1,s+i/pw[d],i%pw[d]);
}
void get(){
	scanf("%lld",&n);
	if(n%10){
		puts("Algosia");return;
	}
	ll i=0;
	for(int d=18;d>=3;d--){
		for(;i/pw[d]%10<n/pw[d]%10;){
			// debug(i,d-1,count(i/pw[d]),i%pw[d],nex(d-1,count(i/pw[d]),i%pw[d]));
			i=i+nex(d-1,count(i/pw[d]),i%pw[d])-i%pw[d]+pw[d];
			// debug(i);
		}
	}
	for(;i<n;i=nex(i));
	puts(i==n?"Bajtek":"Algosia");
	// if(i^n)debug(i,n);
}
int main(){
	memset(his,-1,sizeof his);
	for(int i=pw[0]=1;i<=18;i++)pw[i]=pw[i-1]*10;
	for(scanf("%d",&T);T--;)get();
	return 0;
}