#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize("Ofast","unroll-loops","inline")
#include<bits/stdc++.h>
#define ll long long
//#define int ll
using namespace std;
const int N=22,S=10,M=1e6+20,mod=998244353;
const int mx=18*9;
int n,f[N][N*S][N*S],a[N];
void solve(){
	cin>>n;n++;
	int m=0,p=0,s=0;
	while(n) a[m++]=n%10,n/=10;
	for(int i=m-1;~i;i--){
		for(int j=0;j<a[i];j++) p=f[i][s+j][p];
		s+=a[i];
	}
	!p?cout<<"Bajtek\n":cout<<"Algosia\n";
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	memset(f,-1,sizeof(f));
	for(int i=0;i<=mx;i++) for(int j=0;j<=mx;j++) f[0][i][j]=j<i?j+1:0;
	for(int k=1;k<=18;k++){
		for(int i=0;i<=9*(18-k+1);i++) for(int j=0;j<=9*(18-k+1);j++){
			for(int t=0,&x=f[k][i][j]=j;t<=9;t++){
				x=f[k-1][i+t][x];
			}
		}
	}
	int T;cin>>T;
	while(T--) solve();
	return 0;
}