{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"yass_top_edge_dummy\" style\u003d\"width: 1px; height: 1px; padding: 0px; margin: -9px 0px 0px; border-width: 0px; display: block;\"\u003e\r\n\t\u0026nbsp;\u003c/div\u003e\r\n\u003cdiv id\u003d\"yass_top_edge\" style\u003d\"background-image: url(\u0026quot;chrome://yass/content/edgebgtop.png\u0026quot;); background-attachment: scroll; background-position: center bottom; padding: 0px; margin: 0px 0px 8px -8px; border-width: 0px; height: 0px; display: block; width: 921px;\"\u003e\r\n\t\u0026nbsp;\u003c/div\u003e\r\n\u003cp\u003e\r\n\t\u003cspan style\u003d\"font-size:16px;\"\u003eWe define the parity of an integer \u003cb\u003en\u003c/b\u003e as the sum of the bits in binary representation computed modulo two. As an example, the number \u003ci\u003e21 \u003d 10101\u003csub\u003e2\u003c/sub\u003e\u003c/i\u003e has three \u003ci\u003e\u003cspan data-scayt_word\u003d\"1s\" data-scaytid\u003d\"1\"\u003e1s\u003c/span\u003e\u003c/i\u003e in its binary representation so it has parity \u003ci\u003e3 (mod 2)\u003c/i\u003e, or \u003ci\u003e1\u003c/i\u003e.\u003c/span\u003e\u003c/p\u003e\r\n\u003cp\u003e\r\n\t\u003cspan style\u003d\"font-size:16px;\"\u003eIn this problem you have to calculate the parity of an integer \u003cb\u003e1 \u0026le; I \u0026le; 2147483647\u003c/b\u003e.\u003c/span\u003e\u003c/p\u003e\r\n\u003ch2\u003e\r\n\tInput\u003c/h2\u003e\r\n\u003cp\u003e\r\n\tEach line of the input has an integer \u003cb\u003eI\u003c/b\u003e and the end of the input is indicated by a line where \u003cb\u003eI \u003d 0\u003c/b\u003e that should not be processed.\u003c/p\u003e\r\n\u003ch2\u003e\r\n\tOutput\u003c/h2\u003e\r\n\u003cp\u003e\r\n\tFor each integer \u003cb\u003eI\u003c/b\u003e in the input you should print a line \u003cb\u003eThe parity of B is P (mod 2).\u003c/b\u003e, where \u003cb\u003eB\u003c/b\u003e is the binary representation of \u003cb\u003eI\u003c/b\u003e.\u003c/p\u003e\r\n\u003ch2\u003e\r\n\tSample Input\u003c/h2\u003e\r\n\u003cpre\u003e\r\n1\r\n2\r\n10\r\n21\r\n0\r\n\u003c/pre\u003e\r\n\u003ch2\u003e\r\n\tSample Output\u003c/h2\u003e\r\n\u003cpre\u003e\r\nThe parity of 1 is 1 (mod 2).\r\nThe parity of 10 is 1 (mod 2).\r\nThe parity of 1010 is 2 (mod 2).\r\nThe parity of 10101 is 3 (mod 2).\r\n\u003c/pre\u003e\r\n\u003chr /\u003e"}}]}