{"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\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eDuring their New Year holidays, Alice and Bob play the following game using an array $$$a$$$ of $$$n$$$ integers: \u003c/p\u003e\u003cul\u003e \u003cli\u003e Players take turns, Alice moves first. \u003c/li\u003e\u003cli\u003e Each turn a player chooses any element and removes it from the array. \u003c/li\u003e\u003cli\u003e If Alice chooses \u003cspan class\u003d\"tex-font-style-bf\"\u003eeven value\u003c/span\u003e, then she adds it to her score. If the chosen value is odd, Alice\u0027s score does not change. \u003c/li\u003e\u003cli\u003e Similarly, if Bob chooses \u003cspan class\u003d\"tex-font-style-bf\"\u003eodd value\u003c/span\u003e, then he adds it to his score. If the chosen value is even, then Bob\u0027s score does not change. \u003c/li\u003e\u003c/ul\u003e\u003cp\u003eIf there are no numbers left in the array, then the game ends. The player with the highest score wins. If the scores of the players are equal, then a draw is declared.\u003c/p\u003e\u003cp\u003eFor example, if $$$n \u003d 4$$$ and $$$a \u003d [5, 2, 7, 3]$$$, then the game could go as follows (there are other options): \u003c/p\u003e\u003cul\u003e \u003cli\u003e On the first move, Alice chooses $$$2$$$ and get two points. Her score is now $$$2$$$. The array $$$a$$$ is now $$$[5, 7, 3]$$$. \u003c/li\u003e\u003cli\u003e On the second move, Bob chooses $$$5$$$ and get five points. His score is now $$$5$$$. The array $$$a$$$ is now $$$[7, 3]$$$. \u003c/li\u003e\u003cli\u003e On the third move, Alice chooses $$$7$$$ and get no points. Her score is now $$$2$$$. The array $$$a$$$ is now $$$[3]$$$. \u003c/li\u003e\u003cli\u003e On the last move, Bob chooses $$$3$$$ and get three points. His score is now $$$8$$$. The array $$$a$$$ is empty now. \u003c/li\u003e\u003cli\u003e Since Bob has more points at the end of the game, he is the winner. \u003c/li\u003e\u003c/ul\u003e\u003cp\u003eYou want to find out who will win if both players play optimally. \u003cspan class\u003d\"tex-font-style-bf\"\u003eNote that there may be duplicate numbers in the array\u003c/span\u003e.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains an integer $$$t$$$ ($$$1 \\le t \\le 10^4$$$)\u0026nbsp;— the number of test cases. Then $$$t$$$ test cases follow.\u003c/p\u003e\u003cp\u003eThe first line of each test case contains an integer $$$n$$$ ($$$1 \\le n \\le 2 \\cdot 10^5$$$)\u0026nbsp;— the number of elements in the array $$$a$$$.\u003c/p\u003e\u003cp\u003eThe next line contains $$$n$$$ integers $$$a_1, a_2, \\ldots, a_n$$$ ($$$1 \\le a_i \\le 10^9$$$)\u0026nbsp;— the array $$$a$$$ used to play the game.\u003c/p\u003e\u003cp\u003eIt is guaranteed that the 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, output on a separate line: \u003c/p\u003e\u003cul\u003e \u003cli\u003e \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAlice\u003c/span\u003e\" if Alice wins with the optimal play; \u003c/li\u003e\u003cli\u003e \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eBob\u003c/span\u003e\" if Bob wins with the optimal play; \u003c/li\u003e\u003cli\u003e \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eTie\u003c/span\u003e\", if a tie is declared during the optimal play. \u003c/li\u003e\u003c/ul\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\u003e4\n4\n5 2 7 3\n3\n3 2 1\n4\n2 2 2 2\n2\n7 8\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eBob\nTie\nAlice\nAlice\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}