{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eTyomitch plays the following game with \u003ci\u003eN\u003c/i\u003e of his friends. Tyomitch leaves the room. His friends write numbers from 1 to \u003ci\u003eN\u003c/i\u003e on cards,\r\nand each of the friends takes a card in a way that Tyomitch doesn\u0027t know which card each one has.\r\nLet\u0027s number the friends from 1 to \u003ci\u003eN\u003c/i\u003e. After Tyomitch comes back to the room,\r\neach of his friends makes 2 statements of the following form (examples given for \u003ci\u003ei\u003c/i\u003e\u0027th friend):\r\n\r\n\u003col\u003e\r\n\u003cli\u003e\r\n I have the card number \u003ci\u003ea\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e. \r\n\u003c/li\u003e\r\n\u003cli\u003e\r\n \u003ci\u003eb\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e\u0027th friend has the card number \u003ci\u003ec\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e (\u003ci\u003eb\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e ≠ \u003ci\u003ei\u003c/i\u003e).\r\n\u003c/li\u003e\r\n\u003c/ol\u003e\r\n\r\nExactly one of these statements is true, and the other one is false. It\u0027s known that no two friends said that friend \u003ci\u003eb\u003c/i\u003e has card \u003ci\u003ec\u003c/i\u003e, and nobody said that friend\r\n\u003ci\u003eb\u003c/i\u003e has card \u003ci\u003ec\u003c/i\u003e if \u003ci\u003eb\u003c/i\u003e admitted that he has this very card. The task for Tyomitch is to determine for each of his friends which of\r\nhis statements is true.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe first line of the input contains the number \u003ci\u003eN\u003c/i\u003e (2 ≤ \u003ci\u003eN\u003c/i\u003e ≤ 1000). Each of the following N lines contains a triple \u003ci\u003ea\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003eb\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ec\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e\u0026nbsp;— the statements of Tyomitch\u0027s friends.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe only line of output must contain \u003ci\u003eN\u003c/i\u003e numbers separated with spaces, being the numbers of the true statement (either 1 or 2) for each of the friends. It is known that a solution exists.\u003c/div\u003e\u003c/div\u003e"}},{"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\u003e5\r\n3 4 3\r\n1 3 2\r\n3 2 5\r\n2 5 4\r\n3 4 1\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1 2 2 2 2\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}