#include<bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define ld long double
#define ll long long
#define mp make_pair
#define pb push_back
#define in insert
#define ers erase
#define S second
#define F first

const int N = 2e5 + 5;

void solve() {
	ll n, a[N], alice = 0, bob = 0;
	vector <ll> o, e;
	cin >> n;
	for (int i = 0; i < n; i++) cin >> a[i];
	for (int i = 0; i < n; i++)
		a[i] % 2? o.pb(a[i]): e.pb(a[i]);
	sort(o.begin(), o.end());
	sort(e.begin(), e.end());
	for (int i = 0; i < n; i++)
		if (i % 2 == 0) {
			if (e.empty()) o.ers(o.begin() + o.size() - 1);
			else if (o.empty()) alice += e[e.size() - 1], e.ers(e.begin() + e.size() - 1);
			else if (e[e.size() - 1] > o[o.size() - 1]) alice += e[e.size() - 1], e.ers(e.begin() + e.size() - 1);
			else o.ers(o.begin() + o.size() - 1);
		}
		else {
			if (o.empty()) e.ers(e.begin() + e.size() - 1);
			else if (e.empty()) bob += o[o.size() - 1], o.ers(o.begin() + o.size() - 1);
			else if (o[o.size() - 1] > e[e.size() - 1]) bob += o[o.size() - 1], o.ers(o.begin() + o.size() - 1);
			else e.ers(e.begin() + e.size() - 1);
		}
	cout << (alice == bob? "Tie\n": (alice > bob? "Alice\n": "Bob\n"));
}

int main() {
	ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int t;
	cin >> t;
	while(t--) solve();
	return 0;
}