Steve stumbled upon a collection of (n) gears, where gear (i) has (a_i) teeth, and he wants to arrange them into a row. After he arranges them, Steve will spin the leftmost gear at a speed of (1) revolution per second. For each of the other gears, let (x) be the number of teeth it has, (y) be the number of teeth of the gear to its left, and (z) be the speed the gear to its left spins at. Then, its speed will be (\frac{y}{x} \cdot z) revolutions per second. Steve considers the contraption satisfactory if the rightmost gear spins at a speed of (1) revolution per second. Determine whether Steve can rearrange the gears into a satisfactory contraption. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 1000)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((2 \le n \le 100)) — the number of gears Steve has. The second line of each test case contains (n) integers (a_1,a_2,\ldots,a_n) ((2 \le a_i \le 100)) — the number of teeth of each gear. For each test case, print " YES " if Steve can rearrange the gears in a satisfactory way, and " 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. In the first test case, the second gear will always spin at speed (\frac{5}{5} \cdot 1 = 1) revolution per second, so any arrangement is satisfactory. In the second test case, one possible arrangement is (6, 3, 9, 6). Then: The second gear spins at speed (\frac{6}{3} \cdot 1 = 2) revolutions per second. The third gear spins at speed (\frac{3}{9} \cdot 2 = \frac{2}{3}) revolutions per second. The fourth spins at speed (\frac{9}{6} \cdot \frac{2}{3} = 1) revolution per second. In the third test case, neither of the possible arrangements (2, 3) and $$$[3,