//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define N 15
#define inf 2147483647
#define LL long long
#define DB double
using namespace std;
int T,tot,h,t,q[10005][5],r[N][N][N][N],fir[N][N][N][N],nxt[60005],son[60005][5];bool f[N][N][N][N],vis[N][N][N][N];
inline void add(int a1,int b1,int c1,int d1,int a2,int b2,int c2,int d2){tot++,son[tot][0]=a1,son[tot][1]=b1,son[tot][2]=c1,son[tot][3]=d1,nxt[tot]=fir[a2][b2][c2][d2],fir[a2][b2][c2][d2]=tot,r[a1][b1][c1][d1]++;} struct FastIO{
    static const int S=1048576;
    char buf[S],*L,*R;int stk[20],Top;~FastIO(){clear();}
    inline char nc(){return L==R&&(R=(L=buf)+fread(buf,1,S,stdin),L==R)?EOF:*L++;}inline void clear(){fwrite(buf,1,Top,stdout);Top=0;}
    inline void pc(char ch){Top==S&&(clear(),0);buf[Top++]=ch;}inline void endl(){pc('\n');}
    FastIO& operator >> (char&ch){while(ch=nc(),ch==' '||ch=='\n');return *this;}
    template<typename T>FastIO& operator >> (T&ret){
        ret=0;int f=1;char ch=nc();while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=nc();}
        while(ch>='0'&&ch<='9'){ret=ret*10+ch-'0';ch=nc();}ret*=f;return *this;
    }
    FastIO& operator >> (char* s){int Len=0;char ch=nc();while(ch!='\n'){*(s+Len)=ch;Len++;ch=nc();}}
    template<typename T>FastIO& operator << (T x){
        if(x<0){pc('-');x=-x;}do{stk[++stk[0]]=x%10;x/=10;}while(x);
        while(stk[0]) pc('0'+stk[stk[0]--]);return *this;
    }
    FastIO& operator << (char ch){pc(ch);return *this;}
    FastIO& operator << (string str){int Len=str.size()-1;for(stk[0]=0;Len>=0;Len--) stk[++stk[0]]=str[Len];while(stk[0]) pc(stk[stk[0]--]);return *this;}
}fin,fout;
int main(){
//    freopen("data.in","r",stdin);
//    freopen("jxc.out","w",stdout);
    for(register int i=1;i<=9;i++) for(register int j=1;j<=9;j++) for(register int k=1;k<=9;k++) for(register int p=1;p<=9;p++) 
    if((i+j)%10==0||(i+k)%10==0||(i+p)%10==0||(k+j)%10==0||(p+j)%10==0) vis[i][j][k][p]=1,f[i][j][k][p]=1,t++,q[t][0]=i,q[t][1]=j,q[t][2]=k,q[t][3]=p;
    else add(i,j,k,p,k,p,(i+j)%10,j),add(i,j,k,p,k,p,(i+k)%10,j),add(i,j,k,p,k,p,(i+p)%10,j),add(i,j,k,p,k,p,i,(i+j)%10),add(i,j,k,p,k,p,i,(k+j)%10),add(i,j,k,p,k,p,i,(p+j)%10);
    while(h<t){
        h++;int i=q[h][0],j=q[h][1],k=q[h][2],p=q[h][3];for(register int x=fir[i][j][k][p];x;x=nxt[x]){
            int a=son[x][0],b=son[x][1],c=son[x][2],d=son[x][3];r[a][b][c][d]--;if(vis[a][b][c][d]) continue;
            if(!f[i][j][k][p]){f[a][b][c][d]=1,vis[a][b][c][d]=1,t++,q[t][0]=a,q[t][1]=b,q[t][2]=c,q[t][3]=d;continue;}
            if(!r[a][b][c][d]) f[a][b][c][d]=0,vis[a][b][c][d]=1,t++,q[t][0]=a,q[t][1]=b,q[t][2]=c,q[t][3]=d;
        }
    }
    fin>>T;while(T--){int X1,X2,Y1,Y2;fin>>X1>>X2>>Y1>>Y2;if(!vis[X1][X2][Y1][Y2]) puts("Tie");else if(f[X1][X2][Y1][Y2]) puts("Alice");else puts("Bob");} return 0;
}