//Classic
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define vp vector<pi>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define For(i,a,b) for(ll i=a;i<b;i++)
#define endl "\n"
#define debug(x) cout<<"AA Baju Smit------> "<<#x<<" -> "<<x<<endl
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(), x.rend()
#define mint map<int,int>
#define mod 1000000007
#define ciN cin
////////////////////////////////////////////////////////////////

void jabru() {
	int n; cin >> n;
	vi v(n), e, o;
	For(i, 0, n) {
		cin >> v[i];
		if (v[i] % 2)o.pb(v[i]);
		else e.pb(v[i]);

	}
	sort(rall(o));
	sort(rall(e));
	int a = 0, b = 0;
	ll f = 0, s = 0;
	int move = 0;
	while (move < n) {
		if (move % 2) {
			if (a >= e.size()) {
				s += o[b]; b++;
			}
			else if (b >= o.size()) {
				a++;
			}
			else {
				if (e[a] <= o[b]) {
					s += o[b]; b++;
				}
				else {
					a++;
				}
			}

		}
		else {
			if (b >= o.size()) {
				f += e[a]; a++;
			}
			else if (a >= e.size()) {
				b++;
			}
			else {
				if (e[a] >= o[b]) {
					f += e[a]; a++;
				}
				else {
					b++;
				}
			}
		}
		move++;
	}
	if (f > s) {
		cout << "Alice" << endl;
	}
	else if (s > f) {
		cout << "Bob" << endl;
	}
	else {
		cout << "Tie" << endl;
	}


}


int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll t;
	t = 1;
	cin >> t;
	while (t--) {
		jabru();
	}

	return 0;
}