#include <stdio.h>//#include <bits/stdc++.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstdio>
#define  MAX(x,y) (((x)>(y)) ? (x) : (y))
#define  MIN(x,y) (((x)<(y)) ? (x) : (y))
#define  sq(x) (x)*(x)
#define  cei(a,b) (long long)(((a)+(b)-1)/(b))
#define  mst(a,b) memset((a),b,sizeof((a)))
#define  fi first
#define  se second
#define  pb push_back
using namespace std;
const int MAXN = 1e6+5;
const int N=1e5+5;
const int E4=1e4;
//const long long mod = 1e9+7 ;
//const long long mod = 998244353 ;
const int inf = 0x3f3f3f3f;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int dx[4]= {1,0,0,-1};
int dy[4]= {0,-1,1,0};
int n,m,k;
int x1,x2,y1,y2;
int win[10][10][10][10]= {0};
int lose[10][10][10][10]= {0};
int wn=0,ln=0;
int sn=0;
//int tonum(int a,int b,int c ,int d)
//{
//    return a*1000+b*100+c*10+d;
//}
void solvewin();
void solvelose()
{
    for(int i=1; i<10; i++)
        for(int j=1; j<10; j++)
            for(int k=1; k<10; k++)
                for(int u=1; u<10; u++) {
                    if(win[i][j][k][u]||lose[i][j][k][u])continue;
                    int l=1;
                    if(!win[k][u][(i+j)%10][j])l=0;
                    if(!win[k][u][(i+k)%10][j])l=0;
                    if(!win[k][u][(i+u)%10][j])l=0;
                    if(!win[k][u][i][(j+i)%10])l=0;
                    if(!win[k][u][i][(j+k)%10])l=0;
                    if(!win[k][u][i][(j+u)%10])l=0;
                    if(l) {
                        lose[i][j][k][u]=1;
//                        printf("%d%d%d%d\n",i,j,k,u);
                    }
                }
}
void solvewin()
{
    for(int i=1; i<10; i++)
        for(int j=1; j<10; j++)
            for(int k=1; k<10; k++)
                for(int u=1; u<10; u++) {
                    if(win[i][j][k][u]||lose[i][j][k][u])continue;
                    int w=0;
                    if(lose[k][u][(i+j)%10][j])w=1;
                    if(lose[k][u][(i+k)%10][j])w=1;
                    if(lose[k][u][(i+u)%10][j])w=1;
                    if(lose[k][u][i][(j+i)%10])w=1;
                    if(lose[k][u][i][(j+k)%10])w=1;
                    if(lose[k][u][i][(j+u)%10])w=1;
                    if(w) {
                        win[i][j][k][u]=1;
                        ln++;
                        sn++;
//                        printf("%d%d%d%d\n",i,j,k,u);
                    }
                }
}
void solve()
{
    for(int i=1; i<10; i++)
        for(int j=1; j<10; j++)
            for(int k=1; k<10; k++)
                for(int u=1; u<10; u++) {
                    int f=0;
                    if(i+j==10)f=1;
                    if(i+k==10)f=1;
                    if(i+u==10)f=1;
                    if(j+k==10)f=1;
                    if(j+u==10)f=1;
                    if(f) {
                        win[i][j][k][u]=1;
                        wn++;
                        sn++;
                    }
                }
    for(int i=0; i<4; i++) {
        solvelose();
        solvewin();
//        printf("wn %d ln %d sn %d\n",wn,ln,sn);
    }
    int t,a,b,c,d;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d%d",&a,&b,&c,&d);
        if(win[a][b][c][d])
        printf("Alice\n");
        else if(lose[a][b][c][d])
        printf("Bob\n");
        else printf("Tie\n");
    }
}
int main()
{
//    freopen("D:\\desktop\\in.txt","r",stdin);
//    freopen("D:\\desktop\\win.txt","w",stdout);
    int T=1;
//    scanf("%d",&T);
    for(int i=1; i<=T; i++) {
//        printf("Case %d:\n",i);

        solve();

    }
    return 0;
}