#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
#define eb emplace_back
#define si(x) (int)x.size()
#define all(x) x.begin(),x.end()
#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[200][20][200];
void solve2(){
	ll n; cin >> n;
	if(n%10){
		cout << "Algosia\n";
		return;
	}
	string s="";
	while(n){
		s.pb('0'+n%10);
		n/=10;
	}
	reverse(s.begin(),s.end());
	int pre = 0;
	rep(i,si(s)-1){
		int val = s[i]-'0';
		int sum = 0;
		rep(j,i) sum+=(s[j]-'0');
		rep(j,val){
			pre = dp[sum+j][si(s)-1-i][pre];
			if(sum+j+1 < pre+1) pre = 0;
		}
	}
	cout<<(!pre?"Bajtek":"Algosia")<<'\n';
}
		
void solve(){
	rep(s,180){
		rep(pre,180){
			int np = pre;
			rng(i,1,10){
				np++;
				if(s+i < np) np = 0;
			}
			dp[s][1][pre] = np;
		}
	}
	rng(d,2,20){
		rep(s,180){
			rep(pre,180){
				int np = pre;
				rep(nxt,10){
					np = dp[s+nxt][d-1][np];
					if(nxt != 9){
						if(s+nxt+1 < np+1) np = 0;
					}
				}
				dp[s][d][pre] = np;
			}
		}
	}
}
				
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	solve();
	int t;cin>>t;
	while(t--) solve2();
}