#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define mk make_pair
#define MOD 1000000007
#define pi 3.1415926536
/* BAAP BAAP HOTA HAI
   AUTHOR- Devansh Nandasana*/
void adde(vector<ll> adj[],ll u,ll v)
{
  adj[u].pb(v);
  adj[v].pb(u);
}
ll modInverse(ll a, ll m)
{
    ll m0=m;
    ll y=0,x=1;
    if(m==1)
      return 0;
    while(a>1)
    {
        ll q=a/m;
        ll t=m;
        m=a%m,a=t;
        t=y;
        y=x-q*y;
        x=t;
    }
    if(x<0)
      x+=m0;
    return x;
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll t;
  cin>>t;
  while(t--)
  {
    ll n;
    cin>>n;
    ll a[n];
    for(ll i=0;i<n;i++)
    {
      cin>>a[i];
    }
    sort(a,a+n);
    ll cnt1=0,cnt2=0;
    for(ll i=n-1;i>=0;i-=2)
    {
      if(a[i]%2==0)
      cnt1+=a[i];
    }
    for(ll i=n-2;i>=0;i-=2)
    {
      if(a[i]%2!=0)
      cnt2+=a[i];
    }
    if(cnt1==cnt2)
    cout<<"Tie\n";
    else if(cnt1>cnt2)
    cout<<"Alice\n";
    else
    cout<<"Bob\n";
  }
  return 0;
}
