John has a sequence S what only contains numbers. But John wants to change the sequence S to sequence T what looks more beautiful. John can choose the consecutive subsequence “s[i], s[i+1], …, s[j-1], s[j] (i<j)” and reverse it to “s[j], s[j-1], …, s[i+1], s[i]”. John can choose any consecutive subsequence and reverse them any times. Can John get the sequence T?

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 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.