B. Increasing

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array aa of nn 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

Input

The first line contains a single integer tt (1≤t≤1001≤t≤100) — the number of test cases.

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

The second line of each test case contains nn integers aiai (1≤ai≤1091≤ai≤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

Copy

3

4

1 1 1 1

5

8 7 1 3 4

1

5

output

Copy

NO
YES
YES

Note

In the first test case any rearrangement will keep the array [1,1,1,1][1,1,1,1], which is not strictly increasing.

In the second test case, you can make the array [1,3,4,7,8][1,3,4,7,8].

解题说明：水题，只需要判断不出现相同的数字即可。

#include
int a[1000];
int main()
{
	int b, c, N, n, i, j, k, flag = 1;
	scanf("%d", &N);
	for (i = 0; i < N; i++)
	{
		flag = 1;
		scanf("%d", &n);
		for (j = 0; j < n; j++)
		{
			scanf("%d", &a[j]);
			for (k = 0; k < j; k++)
			{
				if (a[k] == a[j])
				{
					flag = 0;
				}
			}
		}
		if (flag == 1)
		{
			printf("YES\n");
		}
		else
		{
			printf("NO\n");
		}
	}
	return 0;
}