{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"Two players, Alice and Bob are playing a strange game in a **1 x n** board. The cells are numbered from **0** to **n-1**, where the left most cell is marked as cell **0**. Each cell can contain at most one piece.\n\nThere are two kinds of pieces, gray and white. Alice moves all the gray pieces, and bob moves all the white ones. The pieces alternate, that is, leftmost piece is gray, next is white, next to that is gray, then it\u0027s white again, and so on. There will always be equal number of black and gray pieces. Alice can only move pieces to the right. Bob can only move pieces to the left.\n\nIn each move, a player selects one piece and moves that piece, either to its left (Bob) or to its right (Alice), any number of cells (at least 1) but, it can neither jump over other pieces, nor it can move outside of the board. The players alternate their turns.\n\nFor example, if Alice decides to move the left most gray piece, these two moves are available to her.\n\n\n\t\n| | Illustration |\n| :-------------------------------------------------------- | :----------: |\t\n| Fig 1: Initial Position | ![][1] |\n| Fig 2: Alice moving the gray piece one cell to the right | ![][2] |\n| Fig 3: Alice moving the gray piece two cells to the right | ![][3] |\n\n\n\nAlice moves first. The game ends, when someone is unable to make any move, and loses the game. You can assume that, both of them play optimally (that is, if it is possible to apply a strategy that will ensure someone\u0027s win, he/she will always use that strategy).\n\nNow you are given a configuration of a board, you have to find the winner.\n\n[1]: https://static.lightoj.com/images/problem-1192/left_right_1-1605694893056.png\n[2]: https://static.lightoj.com/images/problem-1192/left_right_2-1605694906003.png\n[3]: https://static.lightoj.com/images/problem-1192/left_right_3-1605694920245.png"}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026#8804; 200)**, denoting the number of test cases.\n\nEach case starts with a line containing an integer **k (1 \u0026#8804; k \u0026#8804; 100)** denoting the number of gray pieces in the board. The next line contains **2k** distinct integers (in ascending order) denoting the position of the pieces. The first integer denotes a gray piece, the second integer denotes a white piece, the next integer denotes a gray piece and so on. All the integers will lie in the range **[0, 10\u003csup\u003e9\u003c/sup\u003e]**.\n\nAssume that **n** is sufficiently large to contain all the pieces. And at least one move is remaining."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number and `Alice` or `Bob` depending on the winner of the game."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\n2\n0 3 7 9\n2\n1 3 7 9\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: Alice\nCase 2: Bob\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}