There are three integer arrays a,b,ca,b,c. The lengths of them are all NN. You are given the full contents of aa and bb. And the elements in cc is produced by following equation: c[i]=a[i] XOR b[i]c[i]=a[i] XOR b[i] where XORXOR is the bitwise exclusive or operation.
Now you can rearrange the order of elements in arrays aa and bb independently before generating the array cc. We ask you to produce the lexicographically smallest possible array cc after reordering aa and bb. Please output the resulting array cc.
Input
The first line contains an integer TT indicating there are TT tests.
Each test consists of three lines. The first line contains one positive integer NNdenoting the length of arrays a,b,ca,b,c. The second line describes the array aa. The third line describes the array bb.
* T≤1000T≤1000
* 1≤N≤1051≤N≤105
* integers in arrays aa and bb are in the range of [0,230)[0,230).
* at most 66 tests with N>100
Output
For each test, output a line containing NN integers, representing the lexicographically smallest resulting array cc.