#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define vec(...) vector<__VA_ARGS__>
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

#define yare cout<<"Algosia\n";

#define nare cout<<"Bajtek\n";

int dsum(int x){
	int sun=0;
	while(x) sun+=(x%10),x/=10;
	return sun;
}

const int M=300;

int dp[20][300][2*M];

int qs[20];

int dfs(int i,int ad,int bef){
	if(dp[i][ad][bef+M]!=-1) return dp[i][ad][bef+M];
	int ne_bef=bef;
	rep(x,10){
		if(i>1){
			ne_bef=dfs(i-1,ad+x,ne_bef);
		}else{
			if(ad+x>=ne_bef+1){
				ne_bef+=1;
			}else{
				ne_bef=0;
			}
		}
		// if(i==2) print(ne_bef);
	}
	return dp[i][ad][bef+M]=ne_bef;
}

void gap(){
	rep(len,20){
		rep(ad,300){
			rep(bef,2*M){
				dp[len][ad][bef]=-1;
			}
		}
	}

	// // dfs(2,0,10);
	// for(int len=1;len<=18;len++){
	// 	bef=dfs(len,0,-1);
	// }
	// // print(rec(rec,3,0,19));
}

int naive(int n){
	vi dp(n+3);
	rng(i,1,n+3){
		int s=dsum(i);
		// if(i==90) print("e",s,dp[i-1]);
		dp[i]=dp[i-1]+1;
		if(s<dp[i]) dp[i]=0;
	}
	// print(dp[260]);
	return dp[n];
}

void slv(){
	int n;
	cin>>n;

	if(n==1){
		yare;
		return;
	}

	n-=1;
	vi a;
	int x=n;
	while(x){
		a.pb(x%10);
		x/=10;
	}
	reverse(all(a));

	// for(auto x:a)cout<<x<<" ";
	// print();
	
	map<array<int,4>,int> smdp;
	auto rec=[&](auto self,int i,int ad,int bef,int t){
		if(smdp.find({i,ad,bef,t})!=smdp.end()) return smdp[{i,ad,bef,t}];
		if(t){
			return dfs(sz(a)-i,ad,bef);
		}
		int to=10;
		if(!t) to=a[i]+1;
		int ne_bef=bef;
		rep(x,to){
			if(i!=sz(a)-1){
				ne_bef=self(self,i+1,ad+x,ne_bef,t or (x<a[i]));
				// if(x+1<to){
				// 	ne_bef+=1;
				// }
				// if(i==0) print(x,ne_bef);
			}else{
				// if(i==2 and !t and x==1) print("e",ne_bef,ad+x);
				if(ad+x>=ne_bef+1){
					ne_bef+=1;
				}else{
					ne_bef=0;
				}
			}
			// if(i==1 and x==6 and !t) print("aa",ne_bef);
		}
		// if(i==0) print(ne_bef);
		// if(i==2 and !t and ad==10) print("go",bef,ne_bef,to);
		// if(i==1 and bef==10) print(t,to,ne_bef);
		// return smdp[{i,ad,bef,t}]=ne_bef;
		return ne_bef;
	};

	int bef=rec(rec,0,0,0,0);

	// print(n);
	// print(bef);
	// print(naive(n));
	// assert(bef==naive(n));
	if(dsum(n+1)>=bef){
		yare;
	}else{
		nare;
	}
}

signed main(){
	ios::sync_with_stdio(0),cin.tie(0);
	gap();
	// naive(1000);
	int t;
	cin>>t;
	// t=1;
	rep(cs,t){
		slv();
	}
}