{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eAlice and Bob are very smart guys and they like to play all kinds of games in their spare time. The most amazing thing is that they always find the best strategy, and that\u0027s why they feel bored again and again. They just invented a new game, as they usually did.\u003cbr\u003eThe rule of the new game is quite simple. At the beginning of the game, they write down N random positive integers, then they take turns (Alice first) to either:\u003cbr\u003e1. Decrease a number by one.\u003cbr\u003e2. Erase any two numbers and write down their sum.\u003cbr\u003eWhenever a number is decreased to 0, it will be erased automatically. The game ends when all numbers are finally erased, and the one who cannot play in his(her) turn loses the game.\u003cbr\u003eHere\u0027s the problem: Who will win the game if both use the best strategy? Find it out quickly, before they get bored of the game again!\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains an integer T(1 \u0026lt;\u003d T \u0026lt;\u003d 4000), indicating the number of test cases.\u003cbr\u003eEach test case contains several lines.\u003cbr\u003eThe first line contains an integer N(1 \u0026lt;\u003d N \u0026lt;\u003d 50).\u003cbr\u003eThe next line contains N positive integers A\u003csub\u003e1\u003c/sub\u003e ....A\u003csub\u003eN\u003c/sub\u003e(1 \u0026lt;\u003d A\u003csub\u003ei\u003c/sub\u003e \u0026lt;\u003d 1000), represents the numbers they write down at the beginning of the game."}},{"title":"Output","value":{"format":"HTML","content":"For each test case in the input, print one line: \"Case #X: Y\", where X is the test case number (starting with 1) and Y is either \"Alice\" or \"Bob\"."}},{"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\u003e3\r\n3\r\n1 1 2\r\n2\r\n3 4\r\n3\r\n2 3 5\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: Alice\r\nCase #2: Bob\r\nCase #3: Bob\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}