//
//  main.cpp
//  Codefroces round 3
//
//  Created by aayushi kunwar on 20/10/20.
//

//#include <bits/stdc++.h>

#include <iostream>
#include <unordered_map>
#include <iomanip>
#include<iostream>
#include<string>
#include<stack>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
//#include <bits/stdc++.h>
#include <vector>
#define ll long long int
#define rall(x)            (x).rbegin(),(x).rend()

void solve(){
    ll n , i;
    cin>>n;
    ll arr[n];
    for(i=0;i<n;i++){
        cin>>arr[i];
    }
    sort(arr , arr+n);
    ll m = 0 , x = 0 ;
    for(i=n-1;i>=0;i--){
        if(m==0){
            if(arr[i]%2 == 0){
                x += arr[i];
            }
            m=1;
        }
        else{
            if(arr[i]%2 != 0){
                x -= arr[i];
            }
            m=0;
        }
    }
    if(x > 0){
        cout<<"Alice"<<endl;
    }
    else if(x < 0){
        cout<<"Bob"<<endl;
    }
    else{
        cout<<"Tie"<<endl;
    }
    return ;
}

int main(){
    ll t ;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}
