        #include <bits/stdc++.h>
        using namespace std;
        #define int               long long
        #define pb                push_back
        #define ppb               pop_back
        #define pf                push_front
        #define ppf               pop_front
        #define all(x)            (x).begin(),(x).end()
        #define uniq(v)           (v).erase(unique(all(v)),(v).end())   
        #define sz(x)             (int)((x).size())
        #define fr                first
        #define sc                second
        #define pii               pair<int,int>
        #define rep(i,a,b)        for(int i=a;i<b;i++)
        #define mod 1000000007

       
        int gcd(int a, int b){if(b==0)return a;return gcd(b, a%b);}
        int lcm(int a, int b){return a*b/gcd(a, b);}
        int fexp(int a, int b){int ans = 1;while(b){if(b&1) ans = ans*a%mod; b/=2;a=a*a%mod;}return ans;}
        int inverse(int a, int p){return fexp(a, p-2);}

        struct Comparator
        {
            bool operator() (const std::pair<int, int>& lhs,
                     const std::pair<int, int>& rhs) const
            {
            if (lhs.first == rhs.first)
                return lhs.second < rhs.second;
            else
                return lhs.first > rhs.first;
            }
        };
       
        void solve(){
            int n;cin>>n;
            vector<int>a(n);
            for(auto &i:a){
                cin>>i;
            }
            sort(all(a),greater<int>());
            int alice=0;
            int bob=0;
            rep(i,0,n){
                if(i%2==0){
                    if(a[i]%2==0)alice+=a[i];
                }
                else{
                    if(a[i]%2==1)bob+=a[i];
                }
                // cout<<alice<<" "<<bob<<endl;
            }
            if(alice==bob)cout<<"Tie\n";
            else if(alice>bob)cout<<"Alice\n";
            else cout<<"Bob\n";

            


        }  
        
        signed main(){
            ios_base::sync_with_stdio(0) ;
            cin.tie(0) ; cout.tie(0) ;

            #ifndef ONLINE_JUDGE
            freopen("input.txt", "r", stdin);
            freopen("output.txt", "w", stdout);
            #else   
            #endif

            int t;
            t=1;
            cin>>t;
            while(t--){
                solve();
            }
        

            // #ifndef ONLINE_JUDGE
            // cout<<"\nTime Elapsed: "<<1.0*clock()/ CLOCKS_PER_SEC<<" Sec\n";
            // #endif

            
            return 0;
        }