A. Array with Odd Sumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a consisting of n integers.In one move, you can choose two indices 1 \le i, j \le n such that i \ne j and set a_i := a_j. You can perform such moves any number of times (possibly, zero). You can choose different indices in different operations. The operation := is the operation of assignment (i.e. you choose i and j and replace a_i with a_j).Your task is to say if it is possible to obtain an array with an odd (not divisible by 2) sum of elements.You have to answer t independent test cases.InputThe first line of the input contains one integer t (1 \le t \le 2000) — the number of test cases.The next 2t lines describe test cases. The first line of the test case contains one integer n (1 \le n \le 2000) — the number of elements in a. The second line of the test case contains n integers a_1, a_2, \dots, a_n (1 \le a_i \le 2000), where a_i is the i-th element of a.It is guaranteed that the sum of n over all test cases does not exceed 2000 (\sum n \le 2000).OutputFor each test case, print the answer on it — "YES" (without quotes) if it is possible to obtain the array with an odd sum of elements, and "NO" otherwise.ExampleInput
5
2
2 3
4
2 2 8 8
3
3 3 3
4
5 5 5 5
4
1 1 1 1
Output
YES
NO
YES
NO
NO

5
2
2 3
4
2 2 8 8
3
3 3 3
4
5 5 5 5
4
1 1 1 1

YES NO YES NO NO 
['math', '*800']