write a go solution for Description:
Given an array a_1,a_2,ldots,a_n, determine whether it is possible to rearrange its elements into b_1,b_2,ldots,b_n, such that b_1bmodb_2bmodldotsbmodb_nneq0.

Here xbmody denotes the remainder from dividing x by y. Also, the modulo operations are calculated from left to right. That is, xbmodybmodz=(xbmody)bmodz. For example, 2024bmod1000bmod8=(2024bmod1000)bmod8=24bmod8=0.

Input Format:
The first line of the input contains a single integer t (1<=t<=10^4) — the number of test cases.

The first line of each test case contains a single integer n (2<=n<=10^5).

The second line of each test case contains n integers a_1,a_2,ldots,a_n (1<=a_i<=10^9).

The sum of n over all test cases does not exceed 2*10^5.

Output Format:
For each test case, output "YES" if it is possible, "NO" otherwise.

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

Note:
In the first test case, rearranging the array into b=[1,2,3,4,5,6] (doing nothing) would result in 1bmod2bmod3bmod4bmod5bmod6=1. Hence it is possible to achieve the goal.

In the second test case, the array b must be equal to [3,3,3,3,3], which would result in 3bmod3bmod3bmod3bmod3=0. Hence it is impossible to achieve the goal.

In the third test case, rearranging the array into b=[3,2,2] would result in 3bmod2bmod2=1. Hence it is possible to achieve the goal.. Output only the code with no comments, explanation, or additional text.