G. Grid Game
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Alice and Bob are playing a game on a grid. The grid has $$$10^9$$$ rows and $$$10^9$$$ columns. Rows are numbered from top to bottom $$$1, 2, \ldots, 10^9$$$; columns from left to right $$$1, 2, \ldots, 10^9$$$. There are $$$N$$$ cookies placed on the grid. The $$$i$$$-th cookie is at row $$$r_i$$$ and column $$$c_i$$$. Multiple cookies may occupy the same cell.

Alice and Bob take turns moving cookies, with Alice going first. On Alice's turn, she chooses one cookie and moves it one cell upward. If this move would take the cookie off the top edge of the grid, she eats that cookie. On Bob's turn, he chooses one cookie and moves it one cell to the left. If this move would take the cookie off the left edge of the grid, he eats that cookie as well.

The player who eats the last remaining cookie wins. Assuming both players play optimally, determine who will win.

Input

The first line contains an integer $$$T$$$ — the number of test cases.

The first line of each test case contains an integer $$$N$$$ — the number of cookies.

The next $$$N$$$ ines each contain two positive integers $$$r_i$$$ and $$$c_i$$$ — the row and column of the $$$i$$$-th cookie.

  • $$$1 \leq T \leq 10^5$$$
  • $$$1 \leq N \leq 3 \cdot 10^5$$$
  • $$$1 \leq r_i, c_i \leq 10^9$$$
  • It is guaranteed that the sum of $$$N$$$ over all test cases does not exceed $$$3 \cdot 10^5$$$.
Output

For each test case, if Alice wins, output Alice, otherwise output Bob.

Example
Input
2
1
3 5
2
1 1
1 1
Output
Alice
Bob