human
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.

# Enter your code here. Read input from STDIN. Print output to STDOUT# ===============================================================================================
# importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import ceil, floor
from copy import *
from collections import deque, defaultdict
from collections import Counter as counter  # Counter(list)  return a dict with {key: count}
from itertools import combinations  # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]
from itertools import permutations as permutate
from bisect import bisect_left as bl
from operator import *
# If the element is already present in the list,

# the left most position where element has to be inserted is returned.
from bisect import bisect_right as br
from bisect import bisect

# If the element is already present in the list,
# the right most position where element has to be inserted is returned

# ==============================================================================================
# fast I/O region

BUFSIZE = 8192
from sys import stderr

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") +...