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

#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int N = 2e6 + 10;
const int mod = 1e9 + 7;

int vis[10][10][10][10];
int ans[10][10][10][10];
int solve(int k, int l, int i, int j) {
    if(k >= 10) k -= 10;
    if(l >= 10) l -= 10;
    if(k == 0 || l == 0) return 1;
    if(!vis[i][j][k][l]) return 2;
    if(ans[i][j][k][l]==0) return 1;
    return 0;
}
int main() {

    int num=0;
    for(int p = 1; p <= 9 * 9 * 9 * 9; p++) {
        for(int i = 1; i <= 9; i++) {
            for(int j = 1; j <= 9; j++) {
                for(int k = 1; k <= 9; k++) {
                    for(int l = 1; l <= 9; l++) {
                        if(vis[i][j][k][l]) continue;
                        int q1 = solve(i + j, j, k, l);
                        int q2 = solve(i + k, j, k, l);
                        int q3 = solve(i + l, j, k, l);
                        int q4 = solve(i, j + i, k, l);
                        int q5 = solve(i, j + k, k, l);
                        int q6 = solve(i, j + l, k, l);
                        if(q1==1||q2==1||q3==1||q4==1||q5==1||q6==1){
                            vis[i][j][k][l]=1;
                            ans[i][j][k][l]=1;
                        }else if(q1||q2||q3||q4||q5||q6) continue;
                         vis[i][j][k][l]=1;
                         num++;
                    }
                }
            }
        }
    }
//    for(int i = 1; i <= 9; i++) {
//            for(int j = 1; j <= 9; j++) {
//                for(int k = 1; k <= 9; k++) {
//                    for(int l = 1; l <= 9; l++) {
//                        if(!vis[i][j][k][l]) cout<<i<<" "<<j<<" "<<k<<" "<<l<<endl;
//                    }}}}
//    cout<<num<<endl;
int t;
cin>>t;
while(t--){
    int q1,q2,q3,q4;
    cin>>q1>>q2>>q3>>q4;
    if(vis[q1][q2][q3][q4]) {
        if(ans[q1][q2][q3][q4]==1)cout<<"Alice"<<endl;
        else cout<<"Bob"<<endl;
    }else cout<<"Tie"<<endl;
}
}