{"trustable":false,"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":"MD","content":"给出n堆物品,每堆物品都有若干件,现在A和B进行游戏,每人每轮操作一次,按照如下规则:\n\n1. 任意选择一个堆,假设该堆有x个物品,从中选择k个,要保证0\u003ck\u003cx且0\u003c(x^k)\u003ck。\n\n2. 再增加一个大小为x^k的堆(也就相当于将一个x个物品的堆变成一个k个物品的堆和一个x^k个物品的堆),另外有一个技能,可以将这个大小为x^k的堆变成(2*k)^x的堆,但是这个技能每个人只有一次机会可以使用。\n^为异或符号\n现在问两人轮流操作,都采取最优策略,最后不能操作的人输,问谁会赢。"}},{"title":"Input","value":{"format":"MD","content":" The first line contains the number T of test cases (T\u0026lt;\u003d150). The first line of each test cases contains an integer number n (n\u0026lt;\u003d50), denoting the number of piles. The following n integers describe the number of stones in each pile at the beginning of the game. \n\u003cbr\u003eYou can assume that all the number of stones in each pile will not exceed 100,000. \n\u003cbr\u003e"}},{"title":"Output","value":{"format":"MD","content":" For each test case, print the case number and the answer. if the first player will win the game print \"Yes\"(quotes for clarity) in a single line, otherwise print \"No\"(quotes for clarity). \n\u003cbr\u003e"}},{"title":"Sample Input","value":{"format":"MD","content":"\u003cpre\u003e3\n2\n1 2\n3\n1 2 3\n4\n1 2 3 3\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"MD","content":"\u003cpre\u003eCase 1: No\nCase 2: Yes\nCase 3: No\u003c/pre\u003e"}}]}