
148  The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple  G
Alice and Bob are playing yet another game of stones. The rules of this game are as follow:
Alice is always the first to make a move. Do you know who will win the game if they both play optimally? InputThere are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case: The first line contains an integer n (1 ≤ n ≤ 10^{5}), indicating the number of piles. The second line contains n integers a_{1}, a_{2}, ..., a_{n} (1 ≤ a_{i} ≤ 10^{9}), indicating the number of stones in each pile. The third line of each test case contains n integers b_{1}, b_{2}, ..., b_{n} (0 ≤ b_{i} ≤ 2), indicating the special constraint of each pile. It is guaranteed that the sum of n over all test cases does not exceed 10^{6}. We kindly remind you that this problem contains large I/O file, so it's recommended to use a faster I/O method. For example, you can use scanf/printf instead of cin/cout in C++. OutputFor each test case, output "Alice" (without the quotes) if Alice will win the game. Otherwise, output "Bob" (without the quotes). Sample Input3 2 4 1 1 0 1 3 2 1 1 2 Sample OutputAlice Bob Bob HintFor the first test case, Alice can remove 3 stones from the first pile, and then she will win the game. For the second test case, as Alice can only remove some even number of stones, she is unable to remove all the stones in the first move. So Bob can remove all the remaining stones in his move and win the game. For the third test case, Alice is unable to remove any number of stones at the beginning of the game, so Bob wins. 