#include <bits/stdc++.h>
using namespace std;
int F[22][300][300];
int A[300];
int Dfs(int dep,int lstans,int ds,int lim){
	if(dep == 0){
		if(lstans + 1 <= ds) return lstans + 1;
		return 0;
	}
	int mx = lim == 1 ? A[dep] : 9;
	if(lim == 0 && F[dep][ds][lim] != -1)
		return F[dep][ds][lim];
	int now = lstans;
	for(int i = 0; i <= mx; ++i){
		now = Dfs(dep - 1, now, ds + i, lim && i == mx);
	}
	if(lim == 0) 
		F[dep][ds][lim] = now;
	return now;
}
signed main(){
#ifdef NICEGUODONG
	freopen("data.in","r",stdin);
#endif
	memset(F,-1,sizeof F);
	int T;
	cin >> T;
	while(T--){
		int n;
		cin >> n;
		int cnt = 0;
		while(n){
			A[++cnt] = n % 10;
			n /= 10;
		}
		int res = Dfs(cnt,0,0,1);
		if(res == 0){
			cout << "Bajtek" << '\n';
		}
		else 
			cout << "Algosia" << '\n';
	}
	return 0;
}