{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"求Nim游戏的第一步必胜策略有几种"}},{"title":"Input","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n \u003cspan lang\u003d\"en-us\"\u003e\u003cp\u003eThe input test file will contain multiple test cases, each of which begins with a line indicating the number of piles, 1 ≤ \u003ci\u003en\u003c/i\u003e ≤ 1000. On the next line, there are n positive integers, 1 ≤ \u003ci\u003ek\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e ≤ 1, 000, 000, 000, indicating the number of stones in each pile. The end-of-file is marked by a test case with \u003ci\u003en\u003c/i\u003e \u003d 0 and should not be processed.\u003c/p\u003e\u003c/span\u003e\n \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n \u003cp\u003eFor each test case, write a single line with an integer indicating the number of winning moves from the given Nim position.\u003c/p\u003e\n \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e3\n7 11 13\n2\n1000000000 1000000000\n0\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e3\n0\u003c/pre\u003e"}}]}