/**************************
*                         *
*    Author: Sukesh       *
*                         *
***************************/
#include<bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long int
#define ld long double
#define re(arr, n, m) arr.resize(n, vll (m,0))
#define inp1d(arr) for(auto &it: arr) cin>>it
#define inp1ds(arr, sum) for(auto &it: arr){\
                                cin>>it;\
                                sum+=it;\
                            }
#define inp1dma(arr, m) for(auto &it: arr){\
                                cin>>it;\
                                m = max(m,it);\
                            }
#define inp1dmi(arr, m) for(auto &it: arr){\
                                cin>>it;\
                                m = min(m,it);\
                            }
#define inp2d(arr) for(auto &it1: arr) for(auto &it2: it1) cin>>it2
#define o2d(arr) for(auto it1: arr) {for(auto it2: it1) cout<<it2<<" "; cout<<endl;}
#define o1d(arr) for(auto &it: arr) cout<<it<<" ";
#define f(i,s,e) for(ll i=s;i<e;i++)
#define fe(i,s,e) for(ll i=s;i<=e;i++)
#define fi(i,s,e) for(ll i=s-1;i>=e;i--)
#define vll vector<ll>
#define vbool vector<bool>
#define vstr vector<string>
#define vvll vector<vector<ll>>
#define vsll vector<set<ll>>
#define vmllb vector<map<ll,bool>>
#define mll map<ll, ll>
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin(),v.end()
#define maxi INT_MAX
#define mini INT_MIN
#define S(mo) mo.size()
#define intmp ll temp; cin>>temp
#define nl cout<<endl
using namespace std;

//----------------------------------I/O Functions----------------------------------//
template <typename T>
void in(T &a){cin>>a;}
template <typename T>
void in(T &a, T &b){cin>>a>>b;}
template <typename T>
void in(T &a, T &b, T &c){cin>>a>>b>>c;}
template <typename T>
void in(T &a, T &b, T &c, T &d){cin>>a>>b>>c>>d;}

template <typename T>
void out(T &a){cout<<a;}
template <typename T>
void out(T &a, T &b){cout<<a<<" "<<b;}
template <typename T>
void out(T &a, T &b, T &c){cout<<a<<" "<<b<<" "<<c;}
template <typename T>
void out(T &a, T &b, T &c, T &d){cout<<a<<" "<<b<<" "<<c<<" "<<d;}

template <typename T>
void input(T &n, T &k, vll &arr){
    cin>>n>>k;
    arr.resize(n,0);
    for(auto &it: arr) cin>>it;
}

template <typename T>
void input(T &n, T &a, T &b, vll &arr){
    cin>>n>>a>>b;
    arr.resize(n,0);
    for(auto &it: arr) cin>>it;
}

template <typename T>
void input(T &n, T &m, T &k, vvll &arr){
    cin>>n>>m>>k;
    re(arr,n,m);
    for(auto &it1: arr)
        for(auto &it2: it1)
            cin>>it2;
}

template <typename T>
void input(T &n, T &m, T &a, T &b, vvll &arr){
    cin>>n>>m>>a>>b;
    re(arr,n,m);
    for(auto &it1: arr)
        for(auto &it2: it1)
            cin>>it2;
}
//----------------------------------I/O Functions----------------------------------//

void solve(){
    FIO;
    ll n; in<ll> (n);
    vll a(n);
    inp1d(a);

    sort(all(a), greater<ll> ());
    ll alice = 0, bob = 0;
    f(i,0,n){
        if(i&1){
            if(a[i]&1) bob -= a[i];
        }
        else{
            if(!(a[i]&1)) alice += a[i];
        }
    }

    (bob+alice)?((bob+alice>0)?puts("Alice"):puts("Bob")):puts("Tie");
    return;
}

int main(){
    FIO;
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif


    ll t=1;
    cin>>t;
    while(t--)
    solve();
    return 0;
}