You are given a $2n-$tuple of integers $\left(a_1, a_2, \cdots, a_n, b_1, b_2, \cdots, b_n\right)$. It is called nice if there exists a constant $C$ such that for any permutation $\pi : \{1, 2, \cdots, n\} \to \{1, 2, \cdots n\}$, $\displaystyle \sum_{i=1}^n |a_{\pi(i)} - b_i| = C$. Your task is to test if such a tuple is nice.

Input format:
The first line consists of a single integer t, the number of test cases, 0 < t < 11.
The next 3t lines consist of test cases which are as follows:
The first line consists of a single integer n, such that 0 < n < 100001
The second line consists of n space separated integers $a_i$, all between -1 and 1000000001
The third line consists of n space separated integers $b_i$, all between -1 and 1000000001

Output format:
For each test case, in a new line, print "Nice" if the tuple is nice, and "Not nice" if the tuple is not nice, without the quotation marks.

Problem author: Navneel Singhal