You are given an array a of n positive integers. Determine if, by rearranging the elements, you can make the array strictly increasing. In other words, determine if it is possible to rearrange the elements

                   B. Increasing

time limit per test: 1 second

memory limit per test: 256 megabytes output: standard output

input: standard input

You are given an array a of n positive integers. Determine if, by rearranging the elements, you can make the array strictly increasing. In other words, determine if it is possible to rearrange the elements such that a1 < a <<a, holds.

Input

The first line contains a single integer t (1<<100)-the number of test cases.

The first line of each test case contains a single integer n (1 ≤ n ≤ 100)-the length of the array.

The second line of each test case contains n integers a; (1 < a < 109)- the elements of the array.

Output

For each test case, output "YES" (without quotes) if the array satisfies the condition, and "NO" (without quotes) otherwise.

You can output the answer in any case (for example, the strings "yes", "yes", "Yes" and "YES" will be recognized as a positive answer).

Example

input

3

Copy

4500- 87134

1111

1 5

output

NO

YES

YES

 

array=[]

T=[]

flag=0

L=eval(input("Enter how many elements you want to insert in an array:"))

for i in range(0,L):

 ele=int(input("Enter an element:"))

 array.append(ele)

for i in range(0,L):

 T.append(array[i])

for j in range(0,len(array)):

 for k in range(j+1,len(array)):

  if array[j]==array[k]:

   flag=1

   break

  else:

   flag=0

   break

   

 

   

if flag==1:

  print("No")

else:

  print("Yes ")