Kvass
Alice and Bob play the game "Break the chocolate".
Initially, they have n rectangular pieces of chocolate. The i-th piece has size w[i] * h[i] and is divided into 1 * 1 squares by horizontal and vertical lines.
At her move, Alice may break some piece along some horizontal dividing line, creating two new pieces.
At his move, Bob may break some piece along some vertical dividing line, creating two new pieces.
The obtained pieces can not be rotated.
The player who can't make a move loses the game.
Who will win if Alice is the first player, they must alternate their moves and both are playing optimally?
Input
The first line contains the number of test cases t (1 ≤ t ≤ 1000). After that t test cases follow.
The first line of each test case contains an integer n (1 ≤ n ≤ 10^3). The next n lines contain the description of pieces (one per each line): integers w[i] and h[i] (1 ≤ w[i], h[i] ≤ 10^9). The sum of n over all test cases does not exceed 1000.
Output
Print the name of the winner for each test case on a separate lines: "Alice" or "Bob" (without quotes).