 /* Hare krishna hare krisna krishna krishna hare hare
    Hare rama hare rama rama rama hare hare */

#include<bits/stdc++.h>

using namespace std;
typedef pair<int,int> pii;

#define loop(i,s,n) for(int i=s;i<n;i++)
#define loop2(i,s,n) for(int i=s;i<=n;i++)
#define debug1(a,n)  loop(i,0,n)  cout<<a[i]<<" ";  cout<<endl;
#define debug2(a,n)  loop(i,1,n)  cout<<a[i]<<" "; cout<<endl;
#define x first
#define y second 
#define ll long long

void solve(){
    ll n; cin>>n;
    vector<ll> a,b;
    ll i;
    loop(i,0,n){
        ll y; cin>>y;
        if(y%2){
            a.push_back(y);
        }
        else b.push_back(y);
    }
    ll m = a.size();
    ll o = b.size();
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    reverse(a.begin(),a.end());
    reverse(b.begin(),b.end());
    ll sum1=0,sum2=0;
    i=0;
    ll j=0;
    bool flag=true;
    while(i<m and j<o){
        if(flag){
            if(a[i]>b[j]){
                i++;
            }
            else{
                sum2 +=b[j];
                j++;
            }
            flag=0;
        }
        else{
            if(b[j]>a[i]){
                j++;
            }
            else{
                sum1 +=a[i];
                i++;
            }
            flag =1;
        }
    }
    if(flag){
        for(ll k=j;k<o;k+=2){
            sum2 += b[k];
        }
        for(ll k = i+1;k<m;k +=2){
            sum1 +=a[k];
        }
    }
    else{
        for(ll k=j+1;k<o;k+=2){
            sum2 += b[k];
        }
        for(ll k = i;k<m;k +=2){
            sum1 +=a[k];
        }
    }
    if(sum2==sum1){
        cout<<"Tie\n";
    }
    else if(sum2>=sum1){
        cout<<"Alice\n";
    }
    else{
        cout<<"Bob\n";
    }
    
}
 

 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t; cin>>t;
    while(t--){
    solve();
}
    return 0;
}