{"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 have got a lot of chocolates. All the chocolates are rectangles of different shapes as X\u003csub\u003ei\u003c/sub\u003e * Y\u003csub\u003ei\u003c/sub\u003e.They decide to play an interesting game on the chocolates. They take turns choose a chocolate and split it into two pieces. The one who can not take operations lose. Due to the game is too simple, the additional rules apply. Alice is only allowed to split the chocolate vertically, and Bob is only allowed to split the chocolate horizontally.\u003cbr\u003eSpecifically, for Alice, a chocolate X\u003csub\u003ei\u003c/sub\u003e * Y\u003csub\u003ei\u003c/sub\u003e, can only split into A * Y\u003csub\u003ei\u003c/sub\u003e, and B * Y\u003csub\u003ei\u003c/sub\u003e where A + B \u003d X\u003csub\u003ei\u003c/sub\u003e and A, B \u0026gt; 0. And for Bob, a chocolate X\u003csub\u003ei\u003c/sub\u003e * Y\u003csub\u003ei\u003c/sub\u003e, can only split into X\u003csub\u003ei\u003c/sub\u003e * A, and X\u003csub\u003ei\u003c/sub\u003e * B where A + B \u003d Y\u003csub\u003ei\u003c/sub\u003e and A, B \u0026gt; 0.\u003cbr\u003eAlice and Bob are clever enough to take the optimal operation, if Alice plays first, your are to decide who will win.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input contains multiple test cases. The first line of input contains a single integer denoting the number of test cases.\u003cbr\u003eFor each test case, the first line contains an integer N, the number of pieces of chocolates. (1 \u0026lt;\u003d N \u0026lt;\u003d 100)\u003cbr\u003eFor the next N lines, each line contains two integers X\u003csub\u003ei\u003c/sub\u003e and Y\u003csub\u003ei\u003c/sub\u003e, denoting the chocolate sized X\u003csub\u003ei\u003c/sub\u003e * Y\u003csub\u003ei\u003c/sub\u003e. (1 \u0026lt;\u003d X\u003csub\u003ei\u003c/sub\u003e, Y\u003csub\u003ei\u003c/sub\u003e \u0026lt;\u003d 1000000000)"}},{"title":"Output","value":{"format":"HTML","content":"For each test cases, output \"Alice\" when Alice will win, and \"Bob\" otherwise. See sample test cases for further details. "}},{"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\u003e4\r\n1\r\n1 1\r\n1\r\n2 1\r\n2\r\n2 2\r\n2 1\r\n1\r\n3 2\r\n\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: Bob\r\nCase 2: Alice\r\nCase 3: Alice\r\nCase 4: Bob\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}