human
Give me a Python program to find out who will win if both players play optimally given the following:
During their New Year holidays, Alice and Bob play the following game using an array a of n integers: 

  * Players take turns, Alice moves first. 
  * Each turn a player chooses any element and removes it from the array. 
  * If Alice chooses even value, then she adds it to her score. If the chosen value is odd, Alice's score does not change. 
  * Similarly, if Bob chooses odd value, then he adds it to his score. If the chosen value is even, then Bob's score does not change. 


If there are no numbers left in the array, then the game ends. The player with the highest score wins. If the scores of the players are equal, then a draw is declared.

For example, if n = 4 and a = [5, 2, 7, 3], then the game could go as follows (there are other options): 

  * On the first move, Alice chooses 2 and get two points. Her score is now 2. The array a is now [5, 7, 3]. 
  * On the second move, Bob chooses 5 and get five points. His score is now 5. The array a is now [7, 3]. 
  * On the third move, Alice chooses 7 and get no points. Her score is now 2. The array a is now [3]. 
  * On the last move, Bob chooses 3 and get three points. His score is now 8. The array a is empty now. 
  * Since Bob has more points at the end of the game, he is the winner. 


You want to find out who will win if both players play optimally. Note that there may be duplicate numbers in the array.

Input

The first line contains an integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.

The first line of each test case contains an integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of elements in the array a.

The next line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — the array a used to play the game.

It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.

Output

For each test case, output on a separate line: 

  * "Alice" if Alice wins with the optimal play.

  * "Bob" if Bob wins with the optimal play.

  * "Tie", if a tie is declared during the optimal play. 

Example

Input

4
4
5 2 7...
assistant
#Here is Python program to find out who will win if both players play optimally.

import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
import copy
import time
starttime = time.time()
mod = int(pow(10, 9) + 7)
mod2 = 998244353

def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def L(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
try:
    # sys.setrecursionlimit(int(pow(10,4)))
    sys.stdin = open("input.txt", "r")
    # sys.stdout = open("../output.txt", "w")
except:
    pass
def pmat(A):
    for ele in A:
        print(*ele,end="\n")
# def seive():
#     prime=[1 for i in range(10**6+1)]
#     prime[0]=0
#     prime[1]=0
#     for i in range(10**6+1):
#         if(prime[i]):
#             for j in range(2*i,10**6+1,i):
#                 prime[j]=0
#     return prime

for _ in range(L()[0]):
    n=L()[0]
    A=L()
    
    oddsum=0
    evensum=0
    A.sort()

    for i in range(n):
        if i%2==0:
            x=A.pop()
            evensum+=(0 if x%2 else x)
        else:
            x=A.pop()
            oddsum+=(0 if x%2==0 else x)
    if evensum>oddsum:
        print("Alice")
    elif evensum==oddsum:
        print("Tie")
    else:
        print("Bob")

        
        

    

    


endtime = time.time()
# print(f"Runtime of the program is {endtime - starttime}")