{"trustable":true,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\nThere are three piles of beans. TT and DD pick any number of beans from any pile or the same number from any two piles by turns. Who get the last bean will win. TT and DD are very clever.\n\u003c/p\u003e\n\n\u003cp\u003e\u003cb\u003eInput\u003c/b\u003e\u003c/p\u003e \n\n\u003cp\u003e\nEach test case contains of a single line containing 3 integers \u003ci\u003ea\u003c/i\u003e \u003ci\u003eb\u003c/i\u003e \u003ci\u003ec\u003c/i\u003e, indicating the numbers of beans of these piles. It is assumed that 0 \u0026lt;\u003d \u003ci\u003ea\u003c/i\u003e,\u003ci\u003eb\u003c/i\u003e,\u003ci\u003ec\u003c/i\u003e \u0026lt;\u003d 300 and \u003ci\u003ea\u003c/i\u003e + \u003ci\u003eb\u003c/i\u003e + \u003ci\u003ec\u003c/i\u003e \u0026gt; 0.\n\u003c/p\u003e\n\n\u003cp\u003e\u003cb\u003eOutput\u003c/b\u003e\u003c/p\u003e\n\n\u003cp\u003e\nFor each test case, output 1 if TT will win, ouput 0 if DD will win.\n\u003c/p\u003e\n\n\u003cp\u003e\u003cb\u003eSample Input\u003c/b\u003e\u003c/p\u003e\n\n\u003cpre\u003e1 0 0\n1 1 1\n2 3 6\n\u003c/pre\u003e\n\n\u003cp\u003e\u003cb\u003eSample Output\u003c/b\u003e\u003c/p\u003e\n\n\u003cpre\u003e1\n0\n0\n\u003c/pre\u003e\n\n\u003c!-- updated by watashi @ Nov. 7, 2008 --\u003e\n"}}]}