**Problem Description**

**Input**

The first line is an integer T (T<=20), representing the number of cases.

For each case, the first line contains an integer n (n<=50000), representing the length of sequence S and T. The second line contains n integers representing the sequence S. The third line contains n integers representing the sequence T.

**Output**

Output one line per case, either "Change" (without the quotes) if John can change the sequence S to T, or "No Way" (without the quotes) if not.

**Sample Input**

2 4 4 3 1 2 1 4 3 2 6 1 2 3 4 5 6 4 6 3 1 4 2

**Sample Output**

Change No Way

**Source**

2018绍兴市联赛