A16128 | Array Coloring

You are given an array consisting of $n$ integers. Your task is to determine whether it is possible to color all its elements in two colors in such a way that the sums of the elements of both colors have the same parity and each color has at least one element colored.

For example, if the array is \[ $1,2,4,3,2,3,5,4$ \], we can color it as follows: \[ $\color{blue}{1},\color{blue}{2},\color{red}{4},\color{blue}{3},\color{red}{2},\color{red}{3},\color{red}{5},\color{red}{4}$ \], where the sum of the blue elements is $6$ and the sum of the red elements is $18$ .

The first line contains an integer $t$ ( $1 \le t \le 1000$ ) — the number of test cases.

Each test case begins with a line containing an integer $n$ ( $2 \le n \le 50$ ) — the length of the array $a$ .

The next line contains $n$ integers $a_1,a_2, \dots, a_n$ ( $1 \le a_i \le 50$ ) — the elements of the array $a$ .

For each test case, output "YES" (without quotes) if it is possible to color the array in two colors in such a way that the sums of the elements of both colors have the same parity and each color has at least one element colored, and "NO" otherwise.

You can output "Yes" and "No" in any case (for example, the strings "yES", "yes", and "Yes" will be recognized as correct answers).