{"trustable":true,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eBaoBao has a sequence $a_1,a_2,\\dots,a_n$. He would like to find a subset $S$ of $\\{1, 2, \\dots, n\\}$ such that $\\forall i, j \\in S$, $a_i \\oplus a_j \u0026lt; \\min(a_i,a_j)$ and $|S|$ is maximum, where $\\oplus$ means bitwise exclusive or.\u003c/p\u003e\n\n\u003ch4\u003eInput\u003c/h4\u003e\n\u003cp\u003eThere are multiple test cases. The first line of input contains an integer $T$, indicating the number of test cases. For each test case:\u003c/p\u003e\n\n\u003cp\u003eThe first line contains an integer $n$ ($1 \\le n \\le 10^5$), indicating the length of the sequence.\u003c/p\u003e\n\n\u003cp\u003eThe second line contains n integers: $a_1, a_2, \\dots, a_n$ ($1 \\le a_i \\le 10^9$), indicating the sequence.\u003c/p\u003e\n\n\u003cp\u003eIt is guaranteed that the sum of $n$ in all cases does not exceed $10^5$.\u003c/p\u003e\n\n\u003ch4\u003eOutput\u003c/h4\u003e\n\u003cp\u003eFor each test case, output an integer denoting the maximum size of $S$.\u003c/p\u003e\n\n\u003ch4\u003eSample\u003c/h4\u003e\n\u003ctable class\u003d\"vjudge_sample\"\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\u003e3\n3\n1 2 3\n3\n1 1 1\n5\n1 2323 534 534 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n3\n2\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\n"}}]}