1472_D. Even-Odd Game
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 3
3
3 2 1
4
2 2 2 2
2
7 8


Output


Bob
Tie
Alice
Alice
```python
#: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline

########################################

alice = "Alice"
bob = "Bob"
tie = "Tie"

for ii in range(int(input())):
	n = int(input())
	arr = list(map(int , input().split()))
	arr.sort(reverse = True)
	a = 0
	b = 0
	turn = 1 #1 is alice
	#print(arr)
	for i in range(n):
		if arr[i]%2:
			if not turn:
				b += arr[i]
		else:
			if turn:
				a += arr[i]
		turn = not turn
	if a > b:
		print(alice)
	if a < b:
		print(bob)
	if a == b:
		print(tie)
	









'''
# Wrap solution for more recursion depth
for dx,dy in [[1,0],[0,1],[-1,0],[0,-1]]:
#submit as python3
import collections,sys,threading
sys.setrecursionlimit(10**9)
threading.stack_size(10**8)



threading.Thread(target=solve).start()
'''

```