#include "bits/stdc++.h"
#ifdef DEBUG
#include "PrettyDebug.hpp"
#else
#define debug(...) [](auto...){}(__VA_ARGS__)
#define debuga(...) [](auto...){}(__VA_ARGS__)
#endif
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
#define assume(expr) ((!!(expr))||(exit((fprintf(stderr,"Assumption Failed: %s on Line %d\n",#expr,__LINE__),-1)),false))
#define range basic_string_view
using namespace std; typedef long long ll;
namespace FastIO{
    const int BUF_SIZ=1<<16;
    char in_buf[BUF_SIZ],*got_pos=in_buf,*read_pos=in_buf,out_buf[BUF_SIZ],*write_pos=out_buf;
    inline char get_next_char(){if(read_pos==got_pos){got_pos=read_pos=in_buf;got_pos+=fread(got_pos,sizeof(char),BUF_SIZ,stdin);}return*(read_pos++);}
    inline void flush_output(){fwrite(out_buf,sizeof(char),write_pos-out_buf,stdout);write_pos=out_buf;}
    inline void put_char(char ch){*(write_pos++)=ch;if(write_pos==out_buf+BUF_SIZ)flush_output();}
#ifndef FASTIO_READ_NEGATIVE
    template<typename T> inline void read(T& res){char ch;while(!isdigit(ch=get_next_char()));res=ch^'0';while(isdigit(ch=get_next_char()))res=(res<<3)+(res<<1)+(ch^'0');}
#else
    template<typename T> inline void read(T& res){char ch;bool flg=0;while(!isdigit(ch=get_next_char()))flg|=ch=='-';res=ch^'0';while(isdigit(ch=get_next_char()))res=(res<<3)+(res<<1)+(ch^'0');if(flg)res=-res;}
#endif
    template<typename T> inline void write(T x){if(!x){put_char('0');return;}static int lis[25],*lp=lis;while(x){*(++lp)=x%10;x/=10;}while(lp!=lis)put_char((*(lp--))+'0');}
    template<typename T> inline void writeln(const T& x){write(x);put_char('\n');}
    template<typename T> inline void writesp(const T& x){write(x);put_char(' ');}
    class _IO_Flusher{public:~_IO_Flusher(){flush_output();}}__Flusher;
    class IStream{public:
        template<typename T> inline IStream& operator>>(T& x){read(x);return *this;}
        inline IStream& operator>>(char* str){char ch;while(isspace(ch=get_next_char()));(*(str++))=ch;while(!isspace(ch=get_next_char())){if(ch==EOF)break;(*(str++))=ch;}*str=0;return *this;}
    }Cin;
    class OStream{public:
        template<typename T> inline enable_if_t<is_integral<T>::value,OStream&> operator<< (const T& x){write(x);return *this;}
        inline OStream& operator<< (const char& ch){put_char(ch);return *this;}
        inline OStream& operator<< (const char* str){for(const char* p=str;*p;put_char(*(p++)));return *this;}
    }Cout;
}
using namespace FastIO;
#define cin Cin
#define cout Cout
constexpr ll pw[19]={1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000,10000000000,100000000000,1000000000000,10000000000000,100000000000000,1000000000000000,10000000000000000,100000000000000000,1000000000000000000};
ll f[19][163][163]; // f[i][j][k]: i and higher sum is j, lower is k, get the one before i gets a carry
int D(ll x){int t=0;while(x)t+=x%10,x/=10;;return t;}
ll F(int i,int j,int k){
    // assert(j<=162&&k>=0&&k<pw[i]&&k<=162);
    if(i==0) return k;
    if(f[i][j][k]!=-1) return f[i][j][k];
    ll res=k;
    while(true){
        int O=res/pw[i-1];
        // if(res%pw[i-1]>200) debug(i,j,k,res,O);
        // if(i==5&&j==175&&k==0) debug(i,j,k,res,O);
        // assert(res%pw[i-1]<=162);
        res=O*pw[i-1]+F(i-1,j+O,res%pw[i-1]);
        ll t=(O+1)*pw[i-1]; while(t-D(t)-j<=res) t++;
        if(t>=pw[i]) break;
        res=t; //assert(res/pw[i-1]!=O);
    }
    return f[i][j][k]=res;
}
signed main(){
    // Fin("hh.in"); Fout("hh.out");
    atexit([](){cerr<<"Time = "<<clock()<<" ms"<<endl;});
    // ll t=1; For(i,0,18) assert(pw[i]==t),t*=10;
    // pw[0]=1; For(i,1,18) pw[i]=10*pw[i-1];
    memset(f,-1,sizeof(f));
    // For(i,0,18) For(j,0,(18-i)*9) For(k,0,min(pw[i]-1,162ll)) F(i,j,k);
    int T; cin>>T; while(T--){
        ll n; cin>>n; ll x=0;
        Rev(i,18,0){
            while(x/pw[i]<n/pw[i]){
                x=x/pw[i]*pw[i]+F(i,D(x/pw[i]),x%pw[i]);
                ll t=x; while(x-D(x)<=t) x++;
            }
            if(x>n) break;
        }
        assert(x>=n);
        if(x==n) cout<<"Bajtek\n"; else cout<<"Algosia\n";
    }
    return 0;
}

// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
// CONTINUE, NON-STOPPING, FOR CHARLIEVINNIE

// Started Coding On: October 30 Mon, 16 : 34 : 39