/*
    author - Amol Samota
    date   - 30-12-2020
    time   - 20:16
*/

#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define ll long long int
#define pb push_back
#define mp make_pair
#define GCD(m,n) __gcd(m,n)
#define ln "\n"
#define LCM(m,n) m*(n/GCD(m,n))
#define mod 1000000007
#define MOD 998244353
#define PI 3.14159265
using namespace std;

ll add(ll x, ll y)
{
    x += y;
    while(x >= MOD) x -= MOD;
    while(x < 0) x += MOD;
    return x;
}

ll mul(ll x, ll y)
{
    return (x * 1ll * y) % MOD;
}

ll binpow(ll x, ll y)
{
    ll ans = 1;
    while(y > 0)
    {
        if(y % 2 == 1)
            ans = mul(ans, x);
        x = mul(x, x);
        y /= 2;
    }
    return ans;
}

ll divide(ll x, ll y)
{
    return mul(x, binpow(y, MOD - 2));
}

/////////////////////////////////////////////////////////////////////////////////////////
///////////////////////////////////// NEVER GIVE UP ///////////////////////////////////// 
/////////////////////////////////////////////////////////////////////////////////////////

void royale_paradox()   
{
    ll n;
    cin>>n;
    ll x[n];
    for(ll i=0 ; i<n ; i++)
    {
        cin>>x[i];
    }
    sort(x,x+n);
    ll a=0,b=0;
    ll c=0;
    for(ll i=n-1 ; i>=0 ; i--)
    {
        if(x[i]%2==0 && c%2==0)a+=x[i];
        else if(x[i]%2==1 && c%2==1)b+=x[i];
        c++;
    }
    if(a==b)cout<<"Tie";
    else if(a>b)cout<<"Alice";
    else cout<<"Bob";
    cout<<ln;
    
    
}
    
signed main()
{
    IOS;
    //freopen("input.txt", "r", stdin);   // to be uncommented when I/P 
    //freopen("output.txt", "w", stdout); // & O/P are in file format
    ll TestCases=1;
    cin>>TestCases;
    while(TestCases--){royale_paradox();} 
    return 0;
}