{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eAlice and Bob are playing a game on an array $$$a$$$ of $$$n$$$ positive integers. Alice and Bob make alternating moves with Alice going first.\u003c/p\u003e\u003cp\u003eIn his/her turn, the player makes the following move:\u003c/p\u003e\u003cul\u003e\u003cli\u003e If $$$a_1 \u003d 0$$$, the player loses the game, otherwise:\u003c/li\u003e\u003cli\u003e Player chooses some $$$i$$$ with $$$2\\le i \\le n$$$. Then player decreases the value of $$$a_1$$$ by $$$1$$$ and swaps $$$a_1$$$ with $$$a_i$$$. \u003c/li\u003e\u003c/ul\u003e\u003cp\u003eDetermine the winner of the game if both players play optimally.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe input consists of multiple test cases. The first line contains a single integer $$$t$$$ $$$(1 \\leq t \\leq 2 \\cdot 10^4)$$$ \u0026nbsp;— the number of test cases. The description of the test cases follows.\u003c/p\u003e\u003cp\u003eThe first line of each test case contains a single integer $$$n$$$ $$$(2 \\leq n \\leq 10^5)$$$ \u0026nbsp;— the length of the array $$$a$$$.\u003c/p\u003e\u003cp\u003eThe second line of each test case contains $$$n$$$ integers $$$a_1,a_2 \\ldots a_n$$$ $$$(1 \\leq a_i \\leq 10^9)$$$ \u0026nbsp;— the elements of the array $$$a$$$.\u003c/p\u003e\u003cp\u003eIt is guaranteed that sum of $$$n$$$ over all test cases does not exceed $$$2 \\cdot 10^5$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, if Alice will win the game, output \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAlice\u003c/span\u003e\". Otherwise, output \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eBob\u003c/span\u003e\".\u003c/p\u003e\u003cp\u003eYou can output each letter in any case. For example, \"\u003cspan class\u003d\"tex-font-style-tt\"\u003ealIcE\u003c/span\u003e\", \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAlice\u003c/span\u003e\", \"\u003cspan class\u003d\"tex-font-style-tt\"\u003ealice\u003c/span\u003e\" will all be considered identical.\u003c/p\u003e"}},{"title":"Examples","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\u003e3\n2\n1 1\n2\n2 1\n3\n5 4 4\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eBob\nAlice\nAlice\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the \u003cspan class\u003d\"tex-font-style-bf\"\u003efirst testcase\u003c/span\u003e, in her turn, Alice can only choose $$$i \u003d 2$$$, making the array equal $$$[1, 0]$$$. Then Bob, in his turn, will also choose $$$i \u003d 2$$$ and make the array equal $$$[0, 0]$$$. As $$$a_1 \u003d 0$$$, Alice loses.\u003c/p\u003e\u003cp\u003eIn the \u003cspan class\u003d\"tex-font-style-bf\"\u003esecond testcase\u003c/span\u003e, once again, players can only choose $$$i \u003d 2$$$. Then the array will change as follows: $$$[2, 1] \\to [1, 1] \\to [1, 0] \\to [0, 0]$$$, and Bob loses.\u003c/p\u003e\u003cp\u003eIn the \u003cspan class\u003d\"tex-font-style-bf\"\u003ethird testcase\u003c/span\u003e, we can show that Alice has a winning strategy.\u003c/p\u003e"}}]}