#include<bits/stdc++.h>
using namespace std;

using ll=long long;
using pii=pair<int,int>;
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())

const int N=18,D=188;
ll dp[N][D][N],pw[N+1];

int sum(ll x){
    string s=to_string(x);
    int tot=0;
    for(auto c: s) tot+=c-'0';
    return tot;
}

ll next(int d, ll x){
    for(ll i=x+1; ; ++i){
        if(sum(i)+d<(i-x)*10) return i;
    }
}

void ahcorz(){
    ll n; cin >> n;
    if(n%10){
        cout << "Algosia\n";
        return;
    }
    n/=10;
    if(sum(n)<10){
        cout << "Bajtek\n";
        return;
    }
    if(n<=100){
        int cur=1;
        while(cur<n){
            cur=next(0,cur);
        }
        cout << (cur==n?"Bajtek":"Algosia") << "\n";
        return;
    }
    ll cur=1;
    for(int i=N-1; i>=2; --i){
        int tmp=sum(cur/pw[i+1]);
        for(int j=0; j<10; ++j){
            ll nxt=dp[i][tmp+j][cur%pw[i]];
            ll nw=cur-cur%pw[i]+nxt;
            if(nw>n) break;
            cur=nw;
            if(j<9) cur=next(0,cur);
        }
    }
    while(cur<n) cur=next(0,cur);
    cout << (cur==n?"Bajtek":"Algosia") << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    pw[0]=1;
    for(int i=1; i<=N; ++i) pw[i]=pw[i-1]*10;
    for(int d=0; d<D; ++d){
        for(int j=0; j<N; ++j){
            dp[2][d][j]=j;
            while(1){
                int nxt=next(d,dp[2][d][j]);
                if(nxt>=pw[2]) break;
                dp[2][d][j]=nxt;
            }
            //cout << d << ' ' << j << ' ' << dp[2][d][j] << endl;
        }
    }
    for(int i=3; i<N; ++i) for(int d=0; d<D-10; ++d){
        for(int j=0; j<N; ++j){
            dp[i][d][j]=j;
            for(int cur=0; cur<10; ++cur){
                if(dp[i][d][j]-cur*pw[i-1]<0){
                    dp[i][d][j]=-1;
                    break;
                }
                dp[i][d][j]=dp[i-1][d+cur][dp[i][d][j]-cur*pw[i-1]]+pw[i-1]*cur;
                if(cur<9) dp[i][d][j]=next(d,dp[i][d][j]);
            }
            //if(dp[i][d][j]!=-1) cout << i << ' ' << d << ' ' << j << ' ' << dp[i][d][j] << endl;
        }
    }
    int t=1; cin >> t;
    while(t--) ahcorz();
}