#include <iostream>
#include <vector>
using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}


#define MOD		1000000007
#define INF     (ll)1e18
#define ll		long long int
#define pll		pair<ll, ll>
#define vll     vector<ll>
#define vpll    vector<pll>
#define pb		push_back
#define endl	'\n' // Remove if interactive
#define ff 		first
#define ss 		second
#define fastio 	ios_base::sync_with_stdio(false);cin.tie(NULL)
#define all(v)  v.begin(), v.end()
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)

ll power(ll x, ll y) { ll ans = 1; x %= MOD; while (y) {if (y & 1)ans = (x * ans) % MOD; x = (x * x) % MOD; y >>= 1;} return ans;}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};


#include <algorithm>
//#include <map>
#include <queue>
//#include <cstring>

//#include <bits/stdc++.h>

static bool comp(pair<int, int>& p1, pair<int, int>& p2) {
        return p1.first + p1.second > p2.first + p2.second;
    }

    string helper(vll & av, vll & bv) {
        int n = av.size();
        vector<pair<int, int>> v(n);
        for(int i = 0; i < n; i++) {
            v[i] = {av[i], bv[i]};
        }

        sort(v.begin(), v.end(), comp);
        int alice = 0, bob = 0;

        for(int i = 0; i < n; i++) {
            if(i % 2 == 0) {
                alice += v[i].first;
            } else {
                bob += v[i].second;
            }
        }

        if(alice > bob) {
            return "Alice";
        } else if(alice < bob) {
            return "Bob";
        } else {
            return "Tie";
        }
    }

void solve() {
    ll n;
    cin >> n;
    ll arr[n];
    vll av(n), bv(n);
    priority_queue<ll> pq;
    for(int i = 0; i < n; i++) {
        cin >> arr[i];
//        if(arr[i] & 1) {
//            av[i] = 0;
//            bv[i] = arr[i];
//        } else {
//            av[i] = arr[i];
//            bv[i] = 0;
//        }
        pq.push(arr[i]);
    }

    ll alice = 0;
    ll bob = 0;

    bool first = true;
    while(!pq.empty()) {
        if(pq.top() & 1) {
            if(!first) {
                bob += pq.top();
            }
        } else {
            if(first) {
                alice += pq.top();
            }
        }
        first ^= true;
        pq.pop();
    }

    if(alice > bob) {
        cout << "Alice";
    } else if(alice < bob) {
            cout << "Bob";
        } else {
            cout << "Tie";
        }

    cout << endl;
}

int main() {
    fastio;
    int t;
    cin >> t;
    while(t--) {
        solve();
    }
}
