#include<bits/stdc++.h>
using namespace std;
long long int a[200001],b[200001];
int main(){
	long long int T,n,x,s,k,y,max;
	cin  >>  T;
	while (T--) {
		x=y=0;
		scanf("%lld",&n);
		for (int i=1;i<=n;++i){
			scanf("%lld",&a[i]);
		}
		sort(a+1,a+n+1);
		for (int i=n;i>=1;i-=2){
			if (a[i]%2==0) x+=a[i];
		}
		for (int i=n-1;i>=1;i-=2){
			if (a[i]%2==1) y+=a[i];
		}
		if (x==y) cout << "Tie" << endl;
		else if (x>y) cout << "Alice" << endl;
		else cout << "Bob" << endl;
	}
    return 0;
}
