{"raw_statement":[{"iden":"problem statement","content":"You are given integers $A$ and $B$ between $0$ and $255$ (inclusive). Find a non-negative integer $C$ such that $A \\text{ xor }C=B$.\nIt can be proved that there uniquely exists such $C$, and it will be between $0$ and $255$ (inclusive).\nWhat is bitwise $\\mathrm{XOR}$?The bitwise $\\mathrm{XOR}$ of integers $A$ and $B$, $A\\ \\mathrm{XOR}\\ B$, is defined as follows:\n\n*   When $A\\ \\mathrm{XOR}\\ B$ is written in base two, the digit in the $2^k$'s place ($k \\geq 0$) is $1$ if exactly one of $A$ and $B$ is $1$, and $0$ otherwise.\n\nFor example, we have $3\\ \\mathrm{XOR}\\ 5 = 6$ (in base two: $011\\ \\mathrm{XOR}\\ 101 = 110$)."},{"iden":"constraints","content":"*   $0\\leq A,B \\leq 255$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$A$ $B$"},{"iden":"sample input 1","content":"3 6"},{"iden":"sample output 1","content":"5\n\nWhen written in binary, $3$ will be $11$, and $5$ will be $101$. Thus, their $\\text{xor}$ will be $110$ in binary, or $6$ in decimal.\nIn short, $3 \\text{ xor } 5 = 6$, so the answer is $5$."},{"iden":"sample input 2","content":"10 12"},{"iden":"sample output 2","content":"6\n\n![image](https://img.atcoder.jp/ghi/7295a2123bac11ec5453c66bf19816fc.png)"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}