You are given 2 arrays $a$ and $b$ of size $n$.

Your task is to reorder array $b$ such that the following expression is maximized.

$$(a_1 ⊕ b_1) & (a_2 ⊕ b_2)& (a_3 ⊕ b_3)& … & (a_n ⊕ b_n )$$

**Constraints:**

$1 le n le 10^5$

$0 le a_i,b_i le 2^{30} $