Make Equal With Mod

给定一个长度为 $n$ 的数列 $a$。你可以执行若干次操作，每次操作选择一个大于等于 $2$ 的整数 $x$，然后对于所有的 $1\leqslant i\leqslant n$，将 $a_i$ 替换为 $a_i\bmod x$。 请判断是否有一种操作序列，使得依次执行完该操作序列中的所有操作之后，数列中的所有数都相等。 数据范围： - $t$ 组数据，$1\leqslant t\leqslant 10^4$。 - $1\leqslant n\leqslant 10^5$。 - $0\leqslant a_i\leqslant 10^9$。 - $\sum n\leqslant 2\times 10^5$。 Translated by Eason_AC

You are given an array of $ n $ non-negative integers $ a_1, a_2, \ldots, a_n $ . You can make the following operation: choose an integer $ x \geq 2 $ and replace each number of the array by the remainder when dividing that number by $ x $ , that is, for all $ 1 \leq i \leq n $ set $ a_i $ to $ a_i \bmod x $ . Determine if it is possible to make all the elements of the array equal by applying the operation zero or more times.

The input consists of multiple test cases. The first line contains a single integer $ t $ ( $ 1 \leq t \leq 10^4 $ ) — the number of test cases. Description of the test cases follows. The first line of each test case contains an integer $ n $ ( $ 1 \leq n \leq 10^5 $ ) — the length of the array. The second line of each test case contains $ n $ integers $ a_1, a_2, \ldots, a_n $ ( $ 0 \leq a_i \leq 10^9 $ ) where $ a_i $ is the $ i $ -th element of the array. The sum of $ n $ for all test cases is at most $ 2 \cdot 10^5 $ .

For each test case, print a line with YES if you can make all elements of the list equal by applying the operation. Otherwise, print NO. You may print each letter in any case (for example, "YES", "Yes", "yes", "yEs" will all be recognized as a positive answer).

4
4
2 5 6 8
3
1 1 1
5
4 1 7 0 8
4
5 9 17 5

YES
YES
NO
YES

In the first test case, one can apply the operation with $ x = 3 $ to obtain the array $ [2, 2, 0, 2] $ , and then apply the operation with $ x = 2 $ to obtain $ [0, 0, 0, 0] $ . In the second test case, all numbers are already equal. In the fourth test case, applying the operation with $ x = 4 $ results in the array $ [1, 1, 1, 1] $ .