#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
 
int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
		freopen("input1.txt", "r", stdin);
		freopen("output1.txt", "w", stdout);
	#endif
	int t;
	cin>>t;
	while(t--){
        int n;
		cin>>n;
		int * a= new int[n];
		for(int i=0;i<n;i++){
			cin>>a[i];
		}

		int aliceE  = 0;
		int bobO = 0;
        priority_queue<int> pq1;
        priority_queue<int> pq2;

        for(int i = 0;i<n;i++){
        	if(a[i]%2==0){
                pq1.push(a[i]);
        	}
        	else{
        		pq2.push(a[i]);
        	}
        }
        int cnt  = 0;
        while(!pq1.empty() && !pq2.empty()){
        	if(pq1.top()>pq2.top()){
                if(cnt%2==0){
                	aliceE += pq1.top();
                }
                pq1.pop();
        	}
        	else{
                if(cnt%2==1){
                	bobO += pq2.top();

                }
                pq2.pop();
        	}
        	cnt++;
        }
        while(!pq1.empty()){
        	if(cnt%2==0){
        		aliceE += pq1.top();
        	}
        	pq1.pop();
        	cnt++;
        }
        while(!pq2.empty()){
        	if(cnt%2==1){
            	bobO += pq2.top();
            }
            pq2.pop();
            cnt++;
        }
        if(aliceE>bobO){
        	cout<<"Alice"<<endl;
        }
        else if(aliceE<bobO){
        	cout<<"Bob"<<endl;
        }
        else{
        	cout<<"Tie"<<endl;
        }

	}
}