0.5 Adam and Bob
(RankList for this Question)
Score: 30pts
Time Limit: 5.00 sec
Adam and Bob are best friends and they love to play different games. One day they decided to play a game as follows -

1) They have a list of elements (unique positive integers).
2) They take turns while playing. Adam goes first.
3) In each turn a player can choose multiple elements but he must obey the following condition - if he chooses the element a[i], then he cannot pick the elements which are adjacent to a[i] i.e. a[i-1] and a[i+1] in any of his turns.

The game ends when a player cannot pick any element. Winner of the game will be decided on the basis of the sum of elements picked by them. The player with the maximum sum wins. Output the winner if both are playing optimally, i.e. both of them will try to defeat the opponent.

Note: You cannot change the order of the list. Test cases are made in such a way that tie isn't possible.

1 ≤ t ≤ 100
1 ≤ n ≤ 10^5
1 ≤ a[i] ≤ 10^5

Input Format
The first line contains one integer (t) - the number of test cases.
Each test case consists of
N- Size of the list (1<=n<=10^5)
List of integers (a[0], a[1]…..a[n-1])

Output Format
Print “Adam” - if Adam wins the game
Print “Bob” - if Bob wins the game

Example 1
1 2 3 4


Adam chooses 2 and 4 first. Bob chooses 1 and 3 next. Adam wins.

Log In to solve the Question