#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>

using namespace std;

const long long NMAX = 200005;

vector<long long>par, imp;

int main()
{
	long long t, n, x;
	cin >> t;
	while (t--)
	{
		par.clear();
		imp.clear();
		cin >> n;
		for (long long i = 1 ; i <= n; i++)
		{
			cin >> x;
			if (x & 1) imp.push_back(x);
			else par.push_back(x);
		}
		sort(imp.begin(), imp.end());
		sort(par.begin(), par.end());
		long long scorA = 0, scorB = 0;
		long long indA, indB;
		if (par.empty())
			indA = -1;
		else
			indA = par.size() - 1;
		if (imp.empty())
			indB = -1;
		else
			indB = imp.size() - 1;
		long long mutare = 0;
		while (1)
		{
			if (indA < 0 && indB < 0) break;
			if (mutare == 0) ///Alice
			{
				if (indB < 0)
				{
					scorA += par[indA];
					indA--;
					mutare ^= 1;
					continue;
				}
				if (indA < 0)
				{
					indB--;
					mutare ^= 1;
					continue;
				}
				if (par[indA] >= imp[indB])
				{
					scorA += par[indA];
					indA--;
					mutare ^= 1;
					continue;
				}
				else
				{
					indB--;
					mutare ^= 1;
					continue;
				}
			}
			else ///Bob
			{
				if (indB < 0)
				{
					indA--;
					mutare ^= 1;
					continue;
				}
				if (indA < 0)
				{
					scorB += imp[indB];
					indB--;
					mutare ^= 1;
					continue;
				}
				if (imp[indB] >= par[indA])
				{
					scorB += imp[indB];
					indB--;
					mutare ^= 1;
					continue;
				}
				else
				{
					indA--;
					mutare ^= 1;
					continue;
				}
			}
		}
		if (scorA > scorB)
			cout << "Alice\n";
		else if (scorA == scorB)
			cout << "Tie\n";
		else
			cout << "Bob\n";
	}
	return 0;
}
