EVEN LOVE#12380
You are given an array of integers. For each element a_i (1 \le i \le n), you can choose to either keep the value as it is or replace it with any one of its digits.
Your goal is to determine if it is possible to make the sum of the resulting array even.
The first line contains a single integer (1 \le t \le 10^5) — the number of test cases.
The first line of each test case contains an integer (1 \le n \le 2 \cdot 10^5) — the length of the array.
The second line of each test case contains space-separated integers a_i (0 \le a_i \le 10^9).
It is guaranteed that the sum of over all test cases does not exceed 2 \cdot 10^5.
For each test case, print "YES" if it is possible to create an even sum, and "NO" otherwise.
You may print each letter in any case (for example, "YES", "Yes", "yes", "yEs" will all be recognized as a positive answer).
Example 1
Subtask ( points): No additional constraints