给定整数n和n个整数，如果你可以任意重排这n个整数，请问，是否可以使它成为一个严格递增的序列，可以的话输出YES，否则输出NO
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<a2<⋯<ana1<a2<⋯<an holds.
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.
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).
3
4
1 1 1 1
5
8 7 1 3 4
1
5
NO
YES
YES