Remove Smallest

题意翻译

给你一个 $n$ 个整数的数列，你可以每次选择满足一下条件的两个位置 $i,j$ ： - $i≠j$ - $|a_i-a_j| \le 1$ 然后删除 $a_i,a_j$ 中较小的那一个。 问能否通过若干次操作将数列删除到只剩一个数。

题目描述

You are given the array $ a $ consisting of $ n $ positive (greater than zero) integers. In one move, you can choose two indices $ i $ and $ j $ ( $ i \ne j $ ) such that the absolute difference between $ a_i $ and $ a_j $ is no more than one ( $ |a_i - a_j| \le 1 $ ) and remove the smallest of these two elements. If two elements are equal, you can remove any of them (but exactly one). Your task is to find if it is possible to obtain the array consisting of only one element using several (possibly, zero) such moves or not. You have to answer $ t $ independent test cases.

输入输出格式

输入格式

The first line of the input contains one integer $ t $ ( $ 1 \le t \le 1000 $ ) — the number of test cases. Then $ t $ test cases follow. The first line of the test case contains one integer $ n $ ( $ 1 \le n \le 50 $ ) — the length of $ a $ . The second line of the test case contains $ n $ integers $ a_1, a_2, \dots, a_n $ ( $ 1 \le a_i \le 100 $ ), where $ a_i $ is the $ i $ -th element of $ a $ .

输出格式

For each test case, print the answer: "YES" if it is possible to obtain the array consisting of only one element using several (possibly, zero) moves described in the problem statement, or "NO" otherwise.

输入输出样例

输入样例 #1

5
3
1 2 2
4
5 5 5 5
3
1 2 4
4
1 3 4 4
1
100

输出样例 #1

YES
YES
NO
NO
YES

说明

In the first test case of the example, we can perform the following sequence of moves: - choose $ i=1 $ and $ j=3 $ and remove $ a_i $ (so $ a $ becomes $ [2; 2] $ ); - choose $ i=1 $ and $ j=2 $ and remove $ a_j $ (so $ a $ becomes $ [2] $ ). In the second test case of the example, we can choose any possible $ i $ and $ j $ any move and it doesn't matter which element we remove. In the third test case of the example, there is no way to get rid of $ 2 $ and $ 4 $ .