{"raw_statement":[{"iden":"problem statement","content":"Given an integer $N$, find the base $-2$ representation of $N$.\nHere, $S$ is the base $-2$ representation of $N$ when the following are all satisfied:\n\n*   $S$ is a string consisting of `0` and `1`.\n*   Unless $S =$ `0`, the initial character of $S$ is `1`.\n*   Let $S = S_k S_{k-1} ... S_0$, then $S_0 \\times (-2)^0 + S_1 \\times (-2)^1 + ... + S_k \\times (-2)^k = N$.\n\nIt can be proved that, for any integer $M$, the base $-2$ representation of $M$ is uniquely determined."},{"iden":"constraints","content":"*   Every value in input is integer.\n*   $-10^9 \\leq N \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"\\-9"},{"iden":"sample output 1","content":"1011\n\nAs $(-2)^0 + (-2)^1 + (-2)^3 = 1 + (-2) + (-8) = -9$, `1011` is the base $-2$ representation of $-9$."},{"iden":"sample input 2","content":"123456789"},{"iden":"sample output 2","content":"11000101011001101110100010101"},{"iden":"sample input 3","content":"0"},{"iden":"sample output 3","content":"0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}