#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int ra[200005],rb[200005];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        int n,r;
        cin>>n;
        int ca = 0;
        int cb = 0;
        queue<int> a,b;
        for(int i = 1;i<=n;i++){
            cin>>r;
            if(r%2==0){  //Alice主场
                ra[++ca]=r;
            }else{       //Bob主场
                rb[++cb]=r;
            }
        }
//        cout<<"ca=="<<ca<<endl;
//        cout<<"cb=="<<cb<<endl;
        sort(ra+1,ra+1+ca);
        reverse(ra+1,ra+1+ca);
        for(int i = 1;i<=ca;i++){
//            cout<<ra[i]<<" ";
            a.push(ra[i]);
        }
//        cout<<endl;
        sort(rb+1,rb+1+cb);
        reverse(rb+1,rb+1+cb);
        for(int i = 1;i<=cb;i++){
//            cout<<rb[i]<<" ";
            b.push(rb[i]);
        }
//        cout<<endl;
        long long int x = 0;
        long long int y = 0;
        while(a.size()!=0||b.size()!=0){
//            cout<<"Hello"<<endl;
//            cout<<b.front()<<endl;
            if(b.size()==0){
                x+=a.front();
                a.pop();
            } else if(a.size()==0) {
                b.pop();
            }else if(a.front()>b.front()){
                    //                cout<<a.front()<<endl;
                    x+=a.front();
                    a.pop();
                }
            else{
                b.pop();
            }
            if(!(a.size()!=0||b.size()!=0)){
                break;
            }
            if(a.size()==0){
                y+=b.front();
                b.pop();
            }else if(b.size()==0) {
                a.pop();
            }else if(b.front()>a.front()){
                y+=b.front();
                b.pop();
            }else{
                a.pop();
            }
        }
        if(x>y){
            cout<<"Alice"<<endl;
        }else if(x==y){
            cout<<"Tie"<<endl;
        }else{
            cout<<"Bob"<<endl;
        }
    }
    return 0;
}