#include<iostream>
#include<algorithm>
using namespace std;
long long cmp(long long a,long long b)
{
	return a > b;
}
int main()
{
	int t,n,i;
	long long array[200000],alice,bob;
	cin>>t;
	while(t--)
	{
		alice=0;
		bob=0;
		cin>>n;
		for(i=0;i<n;i++)
		{
			scanf("%lld",&array[i]);
		}
		sort(array,array+n,cmp);
		for(i=0;i<n;i++)
		{
			if(i%2==0)
			{
				if(array[i]%2==0)alice+=array[i];
			}
			else
			{
				if(array[i]%2!=0)bob+=array[i];
			}
		}
		if(alice>bob)cout<<"Alice"<<endl;
		else if(alice<bob)cout<<"Bob"<<endl;
		else cout<<"Tie"<<endl;
	}
}
 	 		  	    	      		   	 		 	