{"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":"\n\n给定 $n$ 个结点的无向完全图。每个点有一个点权为 $a_i$。连接 $i$ 号结点和 $j$ 号结点的边的边权为 $a_i\\oplus a_j$。\n 求这个图的 MST(最小生成树) 的权值。( $1\\le n\\le 2\\times 10^5$,$0\\le a_i\u003c 2^{30}$)。\n\n"}},{"title":"Input","value":{"format":"MD","content":"第一行包含$ n $ ( $ 1\u003c\u003dn\u003c\u003d200000 $ ) - 图中顶点的数量。\n\n第二行包含 $ n $ 整数 $ a_{1} $ , $ a_{2} $ , ..., $ a_{n} $ ( $ 0\u003c\u003da_{i}\u003c2^{30} $ ) -顶点的点权。"}},{"title":"Output","value":{"format":"MD","content":"输出一个整数--MST的权值。"}},{"title":"Examples","value":{"format":"MD","content":"### 样例输入 \n\n```\n5\n1 2 3 4 5\n```\n\n### 样例输出 \n\n```\n8\n```"}},{"title":"Hint","value":{"format":"MD","content":"对于第一个样例,最佳的连接方法是( 1 , 3 ),( 1 , 5 ),( 2 , 3 ),( 4 , 5 ),他们的异或值分别是 2、4、1、1 。和为8。"}}]}