#P9243. [HDU3544]Alice's Game

    ID: 5363 传统题 1000ms 256MiB 尝试: 4 已通过: 2 难度: 8 上传者: 标签>CF2400提高+/省选-不变量分析提取最高置位向下取整与向上取整对称性分析不公平博弈

[HDU3544]Alice's Game

Description

Alice and Bob have got a lot of chocolates. All the chocolates are rectangles of different shapes as Xi * Yi.They decide to play an interesting game on the chocolates. They take turns choose a chocolate and split it into two pieces. The one who can not take operations lose. Due to the game is too simple, the additional rules apply. Alice is only allowed to split the chocolate vertically, and Bob is only allowed to split the chocolate horizontally. Specifically, for Alice, a chocolate Xi * Yi, can only split into A * Yi, and B * Yi where A + B = Xi and A, B > 0. And for Bob, a chocolate Xi * Yi, can only split into Xi * A, and Xi * B where A + B = Yi and A, B > 0. Alice and Bob are clever enough to take the optimal operation, if Alice plays first, your are to decide who will win.

Format

Input

The input contains multiple test cases. The first line of input contains a single integer denoting the number of test cases. For each test case, the first line contains an integer N, the number of pieces of chocolates. (1 <= N <= 100) For the next N lines, each line contains two integers Xi and Yi, denoting the chocolate sized Xi * Yi. (1 <= Xi, Yi <= 1000000000)

Output

For each test cases, output "Alice" when Alice will win, and "Bob" otherwise. See sample test cases for further details.

Samples

4
1
1 1
1
2 1
2
2 2
2 1
1
3 2
Case 1: Bob
Case 2: Alice
Case 3: Alice
Case 4: Bob