Sammy and Simmy love candies and frequently visit the local candy shop. Sammy and Simmy have bought $N$ candy packs. Packet $i$ contains $A_{i}$ candies. Sammy being the elder one is happy only if she has strictly more candies than Simmy. However Simmy, the more sensible one, is happy only if the difference between their number of candies is not more than $1$.

The shopkeeper, being a generous lady, agrees to help Sammy and Simmy by distributing the candies among them in a way that makes both of them happy. The shopkeeper can open the packs and distribute the candies even within a single pack to different people.

------ Input: ------
The first line will contain $T$, the number of testcases.
The first line of every test case will contain $N$, the number of candy packs.
The next line has $N$ integers, the $i_{th}$ integer denoting $A_{i}$,
the number of candies in the $i_{th}$ pack.

------ Output: ------
Output "YES" if its possible for the shopkeeper to make both the sisters happy otherwise output "NO".

------ Constraints ------
$1 ≤ T ≤ 10^{3}$
$1 ≤ N ≤ 10^{3}$
$1 ≤ A_{i} ≤ 100$

----- Sample Input 1 ------
1
2
5 2
----- Sample Output 1 ------
YES
----- explanation 1 ------
Sammy gets 4 candies from the first pack.

Simmy gets 1 candy from the first pack and 2 from the second one.

So in total, Sammy has 4, and Simmy has 3. Since Sammy has strictly more candies than Simmy, Sammy is happy. And since the difference is not more then 1, Simmy is also happy. Thus both of them are happy.

见题面

见题面