Max Min Circle Difference

You are given $N$ integers $A_1, A_2, \ldots, A_N$. Find *any* permutation $B_1, B_2, \ldots, B_N$ of these integers, for which the value of $\min(|B_1 - B_2|, |B_2 - B_3|, \ldots, |B_N - B_1|)$ is maximized. ### Input - The first line of the input contains a single integer $T$, the number of test cases. The description of the test cases follows. - The first line of each test case contains a sing