{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"MD","content":"\u003cp\u003e\u003cspan class\u003d\"tex-font-style-it\"\u003eIn order to celebrate Twice\u0027s 5th anniversary, Tzuyu and Sana decided to play a game.\u003c/span\u003e\u003c/p\u003e\n\u003cp\u003eTzuyu gave Sana two integers $$$a$$$ and $$$b$$$ and a really important quest.\u003c/p\u003e\n\u003cp\u003eIn order to complete the quest, Sana has to output the smallest possible value of ($$$a \\oplus x$$$) + ($$$b \\oplus x$$$) for any given $$$x$$$, where $$$\\oplus$$$ denotes the \u003ca href\u003d\"https://en.wikipedia.org/wiki/Bitwise_operation#XOR\"\u003ebitwise XOR operation\u003c/a\u003e.\u003c/p\u003e\n\n有 $T$ 组询问,每组询问给定 $a,b$,求一个正整数 $x$,使得 $x\\oplus a+x\\oplus b$ 最小,输出这个最小值。"}},{"title":"Input","value":{"format":"MD","content":"\u003cp\u003eEach test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \\le t \\le 10^{4}$$$). Description of the test cases follows.\u003c/p\u003e\n\u003cp\u003eThe only line of each test case contains two integers $$$a$$$ and $$$b$$$ ($$$1 \\le a, b \\le 10^{9}$$$).\u003c/p\u003e"}},{"title":"Output","value":{"format":"MD","content":"\u003cp\u003eFor each testcase, output the smallest possible value of the given expression.\u003c/p\u003e"}},{"title":"Sample 1","value":{"format":"MD","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\u003e6\n6 12\n4 9\n59 832\n28 14\n4925 2912\n1 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e10\n13\n891\n18\n6237\n0\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"MD","content":"\u003cp\u003eFor the first test case Sana can choose $$$x\u003d4$$$ and the value will be ($$$6 \\oplus 4$$$) + ($$$12 \\oplus 4$$$) \u003d $$$2 + 8$$$ \u003d $$$10$$$. It can be shown that this is the smallest possible value.\u003c/p\u003e"}}]}