You 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.


-----Input-----

The 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$).


-----Output-----

For 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.


-----Example-----
Input
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

Difficulty: EASY
Tags: Mathematics

Starter code:

Solutions:
t = int(input())
for i in range(t):
	n = int(input())
	l = input().split()
	total = 0
	pair = 0
	odd = 0
	for i in l:
		total += int(i)
	if total % 2 != 0:
		print('YES')
	else:
		for i in l:
			if int(i) % 2 == 0:
				pair = 1
			else:
				odd = 1
			if pair != 0 and odd != 0:
				print('YES')
				break
		if odd == 0 or pair == 0:
			print('NO')


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	a = sum(l)
	flag = 0
	flg = 0
	if a % 2 == 0:
		for i in l:
			if i % 2 == 0:
				flag = 1
			elif i % 2 != 0:
				flg = 1
	if flag == 1 and flg == 1:
		print('YES')
	elif a % 2 != 0:
		print('YES')
	else:
		print('NO')


def solve(n, arr_a):
	even = odd = 0
	for i in range(0, n):
		if arr_a[i] % 2 == 0:
			even += 1
		else:
			odd += 1
	if odd == 0 or (even == 0 and odd % 2 == 0):
		return 'NO'
	else:
		return 'YES'
t = int(input())
results = list()
for _ in range(0, t):
	n = int(input())
	arr_a = list(map(int, input().split(' ')))
	results.append(solve(n, arr_a))
for result in results:
	print(result)


t = int(input())
while t:
	n = int(input())
	l = list(map(int, input().split()))
	odd = 0
	even = 0
	for i in l:
		if i % 2 != 0:
			odd += 1
		else:
			even += 1
	if odd == 0 or (even == 0 and n % 2 == 0):
		print('NO')
	else:
		print('YES')
	t = t - 1


a = int(input())
for i in range(a):
	c = int(input())
	b = list(map(int, input().split()))
	ev = od = 0
	for j in range(c):
		if b[j] % 2 == 0:
			ev = ev + 1
		else:
			od = od + 1
	if ev == 0 and od % 2 == 0 or od == 0:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	if sum(l) % 2 != 0:
		print('YES')
	else:
		c1 = 0
		c2 = 0
		for i in l:
			if i % 2 == 0:
				c1 = c1 + 1
			else:
				c2 = c2 + 1
		if c2 > 1 and c1 >= 1:
			print('YES')
		else:
			print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	p = 0
	q = 0
	for e in a:
		if e % 2 == 0:
			p += 1
		else:
			q += 1
	if q == 0:
		print('NO')
	elif p == 0:
		if n % 2 == 0:
			print('NO')
		else:
			print('YES')
	else:
		print('YES')


t = int(input())
while t != 0:
	n = int(input())
	arr = input().split()
	arr = [int(i) for i in arr]
	odd = 0
	even = 0
	for i in arr:
		if i % 2 == 0:
			even += 1
		else:
			odd += 1
	if odd % 2 != 0:
		print('YES')
	elif odd != 0 and odd % 2 == 0 and (even > 0):
		print('YES')
	else:
		print('NO')
	t -= 1


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	o = [i for i in a if i & 1]
	e = [i for i in a if i & 1 == 0]
	l = sum(a)
	if l & 1:
		print('YES')
	elif len(e) > 0 and len(o) > 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	s = input().split(' ')
	s = [int(x) for x in s]
	f = False
	suma = sum(s)
	if suma % 2 != 0:
		print('YES')
	elif n < 3:
		print('NO')
	else:
		c1 = 0
		c2 = 0
		for i in s:
			if i % 2 == 0:
				c1 += 1
			else:
				c2 += 1
			if c1 > 0 and c2 > 0:
				break
		if c1 > 0 and c2 > 0:
			print('YES')
		else:
			print('NO')


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	psum = sum(l)
	if psum % 2 == 1:
		print('YES')
	else:
		for i in range(n):
			l[i] %= 2
		if l.count(1) > 0 and l.count(0) > 0:
			print('YES')
		else:
			print('NO')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	print(['YES', 'NO'][all((not x & 1 for x in arr)) or (not n & 1 and all((x & 1 for x in arr)))])


for _ in range(int(input())):
	n = int(input())
	li = list(map(int, input().split()))
	if sum(li) % 2 == 1:
		print('YES')
	else:
		for i in range(len(li)):
			li[i] = li[i] % 2
		if li.count(1) > 0 and li.count(0) > 0:
			print('YES')
		else:
			print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if sum(a) % 2 != 0:
		print('YES')
	else:
		ec = 0
		oc = 0
		for i in range(len(a)):
			if a[i] % 2 == 0:
				ec += a[i]
			else:
				oc += a[i]
		if ec > 0 and oc > 0:
			print('YES')
		else:
			print('NO')


n = int(input())
for i in range(n):
	t = int(input())
	l = list(map(int, input().split()))
	e = 0
	o = 0
	for x in l:
		if x % 2 == 0:
			e += 1
		else:
			o += 1
	if o == 0:
		print('NO')
	elif e == 0:
		if t % 2 != 0:
			print('YES')
		else:
			print('NO')
	else:
		print('YES')


import math
n = int(input(''))
for i in range(0, n):
	f = int(input(''))
	inp = list(map(int, input().split()))
	sum = 0
	count = 0
	for k in range(0, len(inp)):
		if inp[k] % 2 != 0:
			sum += inp[k]
			count += 1
	if count % 2 == 1 or 0 < count < f:
		print('YES')
	else:
		print('NO')


tc = int(input())
for _ in range(tc):
	size = int(input())
	A = list(map(int, input().split()))
	if sum(A) % 2 != 0:
		print('YES')
	else:
		e = 0
		o = 0
		for k in range(0, len(A)):
			if A[k] % 2 == 0:
				e = A[k]
				break
		for k in range(0, len(A)):
			if A[k] % 2 != 0:
				o = A[k]
				break
		if e == 0:
			print('NO')
		elif (sum(A) - e + o) % 2 != 0:
			print('YES')
		else:
			print('NO')


for _ in range(int(input())):
	n = int(input())
	temp = list(map(int, input().split()))
	odd = 0
	eve = 0
	for i in range(n):
		if temp[i] % 2 != 0:
			odd += 1
		else:
			eve += 1
	if odd == 0:
		print('NO')
	elif odd == n and n % 2 != 0:
		print('YES')
	elif odd == n and n % 2 == 0:
		print('NO')
	else:
		print('YES')


while True:
	try:
		t = eval(input())
		for i in range(t):
			n = eval(input())
			list0 = list(map(int, input().split()))
			cnt = 0
			for j in range(n):
				if list0[j] % 2 != 0:
					cnt += 1
			if cnt == n and n % 2 == 0 or cnt == 0:
				print('NO')
			else:
				print('YES')
	except:
		break


def oddSum(arr, n):
	even = odd = 0
	total = sum(arr)
	if total % 2 != 0:
		return 'YES'
	for i in arr:
		if i % 2 == 0:
			even += 1
		else:
			odd += 1
	if even >= 1 and 1 <= odd:
		return 'YES'
	else:
		return 'NO'
testCase = int(input())
while testCase != 0:
	testCase -= 1
	n = int(input())
	arr = [int(x) for x in input().split(' ')]
	print(oddSum(arr, n))


for _ in range(int(input())):
	N = int(input())
	A = list(map(int, input().split()))
	(E, O) = (0, 0)
	for i in range(len(A)):
		if A[i] % 2 == 0:
			E += 1
		else:
			O += 1
	if O >= 1 and O < len(A):
		print('YES')
	elif O == 0:
		print('NO')
	elif E == 0 and len(A) % 2 == 1:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	input()
	arr = list(map(int, input().split(' ')))
	(odd, eve) = (0, 0)
	for i in arr:
		if i % 2 == 0:
			eve += 1
		else:
			odd += 1
	print('YES' if sum(arr) % 2 or (odd and eve) else 'NO')


n = int(input())
for i in range(n):
	t = int(input())
	s = input().split()
	odd = 0
	for j in range(t):
		s[j] = int(s[j])
		if s[j] % 2 == 1:
			odd += 1
	if sum(s) % 2 == 1:
		print('YES')
	elif odd > 0 and odd < t:
		print('YES')
	else:
		print('NO')


import math
import functools

def test(data):
	if sum(data) % 2 == 1:
		return True
	contains_even = False
	contains_odd = False
	for item in data:
		if item % 2 == 0:
			contains_even = True
		if item % 2 == 1:
			contains_odd = True
	if contains_even and contains_odd:
		return True
	return False
T = int(input())
for i in range(T):
	length = int(input())
	data = list(map(int, input().split()))
	if test(data) == True:
		print('YES')
	else:
		print('NO')


def Sum_counter():
	num_of_num = int(input())
	counter = 0
	num_arr = input().split()
	num_arr = list(map(int, num_arr))
	for elem in num_arr:
		if elem % 2 != 0:
			counter += 1
	if num_of_num % 2 == 0 and counter == num_of_num:
		print('NO')
	elif counter > 0:
		print('YES')
	else:
		print('NO')
num_iter = int(input())
for _ in range(num_iter):
	Sum_counter()


for i in range(int(input())):
	m = int(input())
	n = list(map(int, input().split()))
	odd = 0
	even = 0
	for i in n:
		if i % 2 == 0:
			even += 1
		else:
			odd += 1
	if odd == 0:
		print('NO')
	elif odd > 0 and even > 0:
		print('YES')
	elif even == 0:
		if len(n) % 2 != 0:
			print('YES')
		else:
			print('NO')


T = int(input())
t = 0
while t < T:
	N = int(input())
	A = list(map(int, input().split()))
	n = 0
	pari = 0
	dispari = 0
	somma = 0
	while n < N:
		a = A[n]
		somma = somma + a
		if a % 2 == 1:
			dispari = dispari + 1
		else:
			pari = pari + 1
		n = n + 1
	if somma % 2 == 1:
		print('YES')
	elif dispari == N or pari == N:
		print('NO')
	else:
		print('YES')
	t = t + 1


for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	s = 0
	c = 0
	for i in range(n):
		s += a[i]
		if a[i] & 1:
			c += 1
	if s % 2 != 0:
		print('YES')
	elif c == 0 or c == n:
		print('NO')
	else:
		print('YES')


def solve(arr, n):
	even = 0
	for i in arr:
		if i % 2 == 0:
			even += 1
	if even == n:
		print('NO')
		return
	odd = n - even
	if odd == n and n % 2 == 0:
		print('NO')
		return
	print('YES')

def main():
	t = int(input())
	for i in range(t):
		n = int(input())
		arr = list(map(int, input().split()))
		solve(arr, n)
main()


n = int(input())
for i in range(0, n):
	l = int(input())
	a = [int(x) for x in input().split()]
	a_odd = [x % 2 for x in a]
	s = sum(a_odd)
	if s > 0:
		if s < l or s % 2 == 1:
			print('YES')
		else:
			print('NO')
	else:
		print('NO')


for i in range(int(input())):
	input()
	(a1, a2) = (0, 0)
	for x in map(int, input().split()):
		if x % 2 == 0:
			a2 += 1
		else:
			a1 += 1
	if a1 % 2 == 1:
		print('YES')
	elif a1 > 0 and a2 > 0:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	t = list(map(int, input().split()))
	if sum(t) % 2:
		print('YES')
	else:
		odd = False
		even = False
		for i in t:
			if i % 2:
				odd |= True
			else:
				even |= True
		if odd & even:
			print('YES')
		else:
			print('NO')


n = int(input())
for i in range(n):
	a = int(input())
	b = list(map(int, input().split()))
	if sum(b) % 2 != 0:
		print('YES')
	else:
		c = 0
		for j in b:
			if j % 2 != 0:
				c += 1
		if c > 0 and c < a:
			print('YES')
		else:
			print('NO')


t = int(input())
for _ in range(t):
	q = int(input())
	a = list(map(int, input().split()))
	odd = 0
	for item in a:
		if item % 2 == 1:
			odd += 1
	if odd == 0:
		print('NO')
	elif odd % 2 == 1:
		print('YES')
	elif odd == q:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	e = 0
	o = 0
	for i in a:
		if i % 2:
			o += 1
		else:
			e += 1
	if n % 2 and o == n:
		print('YES')
	elif o > 0 and e > 0:
		print('YES')
	else:
		print('NO')


for t in range(int(input())):
	n = int(input())
	a = [int(x) % 2 for x in input().rstrip().split()]
	if sum(a) % 2 == 1 or (0 in a and 1 in a):
		print('YES')
	else:
		print('NO')


for q in range(int(input())):
	n = int(input())
	line = list(map(int, input().split()))
	i = 0
	while i < n and line[i] % 2 == 0:
		i += 1
	if i == n:
		print('NO')
	elif i == 0:
		while i < n and line[i] % 2 == 1:
			i += 1
		if i == n and sum(line) % 2 == 0:
			print('NO')
		else:
			print('YES')
	else:
		print('YES')


for i in range(int(input())):
	am = int(input())
	arr = list(map(int, input().split()))
	fl = False
	fl1 = False
	for g in range(am):
		if arr[g] % 2 == 0:
			fl = True
		else:
			fl1 = True
	if fl1 and fl or (fl1 and am % 2 == 1):
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
t = int(input())
for _ in range(t):
	n = int(input())
	nums = list(map(int, stdin.readline().strip().split()))
	(e, o) = (0, 0)
	for i in nums:
		if i % 2 == 0:
			e += 1
		else:
			o += 1
	if o == 0:
		print('NO')
	elif n % 2 == 0 and e == 0:
		print('NO')
	else:
		print('YES')


t = int(input())
for _ in range(t):
	n = int(input())
	count = 0
	lis = [int(x) for x in input().split()]
	if sum(lis) % 2 != 0:
		print('YES')
	else:
		for i in lis:
			if i % 2 != 0:
				count += 1
				break
		for j in lis:
			if j % 2 == 0:
				count += 1
				break
		if count >= 2:
			print('YES')
		else:
			print('NO')


t = int(input())
i = 0
while i < t:
	a = int(input())
	riga = list(map(int, input().strip().split()))
	tot = riga[0]
	i1 = 1
	while i1 < a:
		tot = tot + riga[i1]
		i1 = i1 + 1
	if tot % 2 != 0:
		print('YES')
	else:
		i1 = 1
		if riga[0] % 2 == 0:
			ris = True
		else:
			ris = False
		d = ris
		while i1 < a:
			if riga[i1] % 2 == 0:
				ris = True
			else:
				ris = False
			if ris != d:
				print('YES')
				break
			i1 = i1 + 1
		if ris == d:
			print('NO')
	i = i + 1


from collections import Counter
t = int(input())
for _ in range(t):
	n = int(input())
	x = Counter((int(v) % 2 for v in input().split()))
	print('YES' if x[1] % 2 > 0 or (x[0] > 0 and x[1] > 0) else 'NO')


n = int(input())
for t in range(n):
	no = int(input())
	arr = [int(k) for k in input().split()]
	(eve, odd) = (0, 0)
	for i in arr:
		if i % 2 == 0:
			eve += 1
		else:
			odd += 1
	if eve >= 1 and odd >= 1 or odd % 2 != 0:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	(sum, k1, k2) = (0, False, False)
	for k in l:
		sum += k
		if k % 2 == 0:
			k1 = True
		else:
			k2 = True
	print('YES' if sum % 2 != 0 or k1 == k2 else 'NO')


for _ in range(int(input())):
	x = int(input())
	s = list(map(int, input().split()))
	if sum(s) % 2:
		print('YES')
	else:
		total = sum((1 for i in s if i % 2))
		if 0 < total < x:
			print('YES')
		else:
			print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	s = list(map(int, input().split()))
	odd = 0
	even = 0
	for i in range(len(s)):
		if s[i] % 2 == 0:
			even = even + 1
		else:
			odd = odd + 1
	if even == n or (n % 2 == 0 and odd == n):
		print('NO')
	else:
		print('YES')


n = int(input())
for _ in range(n):
	N = input()
	N = list(map(int, input().split()))
	chet = 0
	nech = 0
	for i in N:
		if i % 2 == 0:
			chet += 1
		else:
			nech += 1
	if sum(N) % 2 != 0 or (chet > 0 and nech > 0):
		print('YES')
	else:
		print('NO')


def solve():
	n = int(input())
	arr = list(map(int, input().split()))
	if sum(arr) % 2 == 1:
		print('Yes')
		return
	if n % 2 == 1:
		for i in range(n):
			if arr[i] % 2 == 1:
				print('Yes')
				return
		print('No')
	else:
		flage = 0
		flago = 0
		for i in range(n):
			if arr[i] % 2 == 0:
				flage = 1
			else:
				flago = 1
			if flage and flago:
				print('Yes')
				return
		print('No')
t = int(input())
while t:
	solve()
	t = t - 1


for _ in range(int(input())):
	t = int(input())
	a = [int(_) for _ in input().split()]
	if not sum(a) % 2 == 0:
		print('YES')
	else:
		parz = nieparz = False
		for i in range(t):
			if a[i] % 2 == 0:
				parz = True
			else:
				nieparz = True
			if parz and nieparz:
				break
		if parz and nieparz:
			print('YES')
		else:
			print('NO')


def main():
	n = int(input())
	a = list(map(int, input().split()))
	cnte = 0
	cnto = 0
	for i in range(len(a)):
		if a[i] % 2 == 0:
			cnte += 1
		else:
			cnto += 1
	if sum(a) % 2 != 0:
		print('YES')
	elif cnte > 0 and cnto > 0:
		print('YES')
	else:
		print('NO')
	return

def test():
	t = int(input())
	while t:
		main()
		t -= 1
test()


import sys
import math
import itertools
import functools
import collections
import operator

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(map(int, input().split()))

def lcm(a, b):
	return abs(a * b) // math.gcd(a, b)

def revn(n):
	return str(n)[::-1]

def dd():
	return collections.defaultdict(int)

def ddl():
	return collections.defaultdict(list)

def sieve(n):
	if n < 2:
		return list()
	prime = [True for _ in range(n + 1)]
	p = 3
	while p * p <= n:
		if prime[p]:
			for i in range(p * 2, n + 1, p):
				prime[i] = False
		p += 2
	r = [2]
	for p in range(3, n + 1, 2):
		if prime[p]:
			r.append(p)
	return r

def divs(n, start=2):
	r = []
	for i in range(start, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n / i == i:
				r.append(i)
			else:
				r.extend([i, n // i])
	return r

def divn(n, primes):
	divs_number = 1
	for i in primes:
		if n == 1:
			return divs_number
		t = 1
		while n % i == 0:
			t += 1
			n //= i
		divs_number *= t

def prime(n):
	if n == 2:
		return True
	if n % 2 == 0 or n <= 1:
		return False
	sqr = int(math.sqrt(n)) + 1
	for d in range(3, sqr, 2):
		if n % d == 0:
			return False
	return True

def convn(number, base):
	newnumber = 0
	while number > 0:
		newnumber += number % base
		number //= base
	return newnumber

def cdiv(n, k):
	return n // k + (n % k != 0)
t = ii()
for _ in range(t):
	n = ii()
	a = li()
	if all((a[i] & 1 for i in range(n))) and (not n & 1) or all((not a[i] & 1 for i in range(n))):
		print('NO')
	else:
		print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if sum(a) % 2 != 0:
		print('YES')
	elif n % 2 != 0:
		c = 0
		for j in range(n):
			if a[j] % 2 != 0:
				c += 1
		if c == 0:
			print('NO')
		else:
			print('YES')
	else:
		even = 0
		odd = 0
		for g in range(n):
			if a[g] % 2 == 0:
				even += 1
				break
		for v in range(n):
			if a[v] % 2 != 0:
				odd += 1
				break
		if odd == even == 1:
			print('YES')
		else:
			print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	arr = [int(i) for i in input().split()]
	sum = 0
	oddcnt = 0
	evencnt = 0
	for i in arr:
		if i % 2 == 0:
			evencnt += 1
		else:
			oddcnt += 1
		sum += i
	if sum % 2 == 1:
		print('YES')
	elif oddcnt == n or evencnt == n:
		print('NO')
	else:
		print('YES')


for t in range(int(input())):
	N = int(input())
	A = list(map(int, input().split()))
	if sum(A) % 2 == 1:
		print('YES')
	else:
		odd = 0
		even = 0
		for x in A:
			if x % 2 == 0:
				even += 1
			else:
				odd += 1
		if even > 0 and odd > 0:
			print('YES')
		else:
			print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	li = list(map(int, input().split()))
	neg = None
	pos = None
	for j in li:
		if neg and pos:
			break
		if j % 2 == 0:
			pos = True
		else:
			neg = True
	if neg and pos:
		print('YES')
	elif neg and n % 2 != 0:
		print('YES')
	elif neg and n % 2 == 0:
		print('NO')
	elif pos and n % 2 != 0:
		print('NO')
	elif pos and n % 2 == 0:
		print('NO')
	elif not neg and (not pos):
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	odds = [a[i] % 2 == 1 for i in range(n)]
	evens = [a[i] % 2 == 0 for i in range(n)]
	if sum(a) % 2 == 0 and (all(odds) or all(evens)):
		print('NO')
	else:
		print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	x = list(map(int, input().split()))
	odd = 0
	even = 0
	if sum(x) % 2 != 0:
		print('YES')
	else:
		for i in x:
			if i % 2 != 0:
				odd = 1
			else:
				even = 1
		if odd == 1 and even == 1:
			print('YES')
		else:
			print('NO')


test = int(input())
for l in range(test):
	num = int(input())
	sol = list(map(int, input().split()))
	if sum(sol) % 2 != 0:
		print('YES')
	else:
		temp = [i for i in sol if i % 2 != 0]
		if len(temp) == len(sol) or len(temp) == 0:
			print('NO')
			continue
		else:
			print('YES')


import math
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	tmp = 0
	for i in range(n):
		if a[i] % 2 == 1:
			tmp += 1
	if tmp > 0:
		if tmp % 2 == 1:
			print('YES')
		elif tmp % 2 == 0 and n - tmp > 0:
			print('YES')
		else:
			print('NO')
	else:
		print('NO')


ans = []
for _ in range(int(input())):
	input()
	a = [int(x) for x in input().split()]
	if sum(a) % 2:
		x = 'YES'
	else:
		b = [y % 2 for y in a]
		if 1 in b and 0 in b:
			x = 'YES'
		else:
			x = 'NO'
	ans.append(x)
print('\n'.join(ans))


t = int(input())
for i in range(0, t):
	n = int(input())
	a = list(map(int, input().split()))
	countodd = 0
	counteven = 0
	for k in range(0, n):
		num = a[k]
		if num % 2 == 0:
			counteven = counteven + 1
		else:
			countodd = countodd + 1
	if countodd == 0:
		print('NO')
	elif countodd % 2 == 1:
		print('YES')
	elif counteven > 0:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	x = [int(n) for n in input().split()]
	od = 0
	for i in x:
		if i & 1:
			od += 1
	ev = n - od
	if (od & 1 or (od % 2 == 0 and ev > 0)) and od != 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	a = int(input())
	l = list(map(int, input().strip().split()))
	if sum(l) % 2 != 0:
		print('YES')
	else:
		even = 0
		odd = 0
		for i in l:
			if i % 2 == 0:
				even = even + 1
			else:
				odd = odd + 1
		if odd == a or even == a:
			print('NO')
		else:
			print('YES')


num_cases = int(input())
for i in range(num_cases):
	num_elements = int(input())
	array = [int(n) for n in input().split()]
	odd = False
	even = False
	if num_elements % 2 == 0:
		for j in range(num_elements):
			if array[j] % 2 == 0:
				even = True
			else:
				odd = True
	else:
		even = True
		for j in range(num_elements):
			if array[j] % 2 == 1:
				odd = True
	if odd and even:
		print('YES')
	else:
		print('NO')


import math
t = int(input())
for _ in range(t):
	n = int(input())
	nums = [int(i) for i in input().split(' ')]
	isOdd = False
	isEven = False
	for i in nums:
		if i % 2 == 1:
			isOdd = True
		else:
			isEven = True
	if isOdd and len(nums) % 2 == 1:
		print('YES')
	elif isOdd and isEven:
		print('YES')
	else:
		print('NO')


testcases = int(input())
for t in range(testcases):
	ans = 0
	n = int(input())
	odd = 0
	even = 0
	l = list(map(int, input().split()))
	for i in range(n):
		if l[i] % 2 == 1:
			odd += 1
		else:
			even += 1
	if odd >= 1 and even == 0 and (n % 2 == 0):
		ans = 'NO'
	elif even >= 1 and odd == 0:
		ans = 'NO'
	else:
		ans = 'YES'
	print(ans)


for i in range(int(input())):
	n = int(input())
	o = 0
	e = 0
	l = [int(x) for x in input().split()]
	if sum(l) % 2 != 0:
		print('YES')
	else:
		for i in l:
			if i % 2 == 0:
				e += 1
			else:
				o += 1
		if e >= 1 and o >= 1:
			print('YES')
		else:
			print('NO')


t = int(input())
s = []
for i in range(t):
	n = int(input())
	a = input().split(' ')
	if n % 2 != 0:
		for j in range(n):
			if int(a[j]) % 2 != 0:
				s.append('YES')
				break
			elif j == n - 1:
				s.append('NO')
	else:
		(b, c) = (0, 0)
		for k in range(n):
			a[k] = int(a[k])
			if a[k] % 2 != 0:
				b += 1
			else:
				c += 1
		if b != 0 and c != 0:
			s.append('YES')
		else:
			s.append('NO')
for l in range(t):
	print(s[l])


tests = int(input())
for i in range(tests):
	n = int(input())
	arr = list(map(int, input().split()))
	if sum(arr) % 2 == 1:
		print('YES')
	elif n % 2 == 1:
		for i in range(n):
			if arr[i] % 2 == 1:
				break
		if arr[i] * n % 2 == 1:
			print('YES')
		else:
			print('NO')
	else:
		for i in range(n):
			if arr[i] % 2 == 0:
				break
		total = 0
		total = arr[i] * (n - 1)
		for i in range(n):
			if arr[i] % 2 == 1:
				break
		total += arr[i]
		if total % 2 == 0:
			print('NO')
		else:
			print('YES')


t = int(input())
for zz in range(t):
	n = int(input())
	a = [int(i) for i in input().split()]
	ha = False
	ho = False
	he = False
	for i in a:
		if i % 2 == 1:
			ho = True
		else:
			he = True
	if n % 2 == 0:
		ha = ho and he
	else:
		ha = ho
	if ha:
		print('YES')
	else:
		print('NO')


def check(l):
	for i in range(0, len(l)):
		if l[i] % 2 != 0:
			print('YES')
			return
	print('NO')
	return

def check1(l):
	flage = 0
	flagod = 0
	for i in range(0, len(l)):
		if flagod == 0 and l[i] % 2 != 0:
			flagod = 1
		if flage == 0 and l[i] % 2 == 0:
			flage = 1
		if flagod == 1 and flage == 1:
			print('YES')
			return
	print('NO')
	return
t = int(input())
while t > 0:
	n = int(input())
	l = list(map(int, input().split(' ')))
	if n % 2 == 0 and n != 2:
		check1(l)
	elif n == 2 or n == 1:
		s = sum(l)
		if s % 2 == 0:
			print('NO')
		else:
			print('YES')
	else:
		check(l)
	t = t - 1


for tc in range(int(input())):
	n = int(input())
	lis = [int(i) for i in input().split()]
	s = sum(lis)
	if s % 2 != 0:
		print('YES')
	else:
		ec = 0
		oc = 0
		for i in lis:
			if i % 2 == 0:
				ec += 1
			else:
				oc += 1
		if ec > 0 and oc > 0:
			print('YES')
		else:
			print('NO')


for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	c = sum((i % 2 for i in a))
	if c == 0 or (c == n and n % 2 == 0):
		print('NO')
	else:
		print('YES')


T = int(input())
for i in range(T):
	e = 0
	o = 0
	n = int(input())
	a = list(map(int, input().split()))
	for j in range(n):
		if a[j] % 2 != 0 or a[j] == 1:
			o = o + 1
		else:
			e = e + 1
	if sum(a) % 2 != 0 or sum(a) == 1:
		print('YES')
	elif o != 0 and e != 0:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	s = int(input())
	a = list(map(int, input().split()))
	odd = 0
	even = 0
	flg = 0
	for j in a:
		if j % 2 == 1:
			odd += 1
		else:
			even += 1
	if odd >= 1 and even >= 1:
		print('YES')
		continue
	if odd == 0:
		print('NO')
		continue
	if even == 0:
		if odd % 2 == 0:
			print('NO')
		else:
			print('YES')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	(even, odd) = (0, 0)
	for i in a:
		if i % 2 == 0:
			even += 1
		else:
			odd += 1
	if sum(a) % 2 != 0:
		print('YES')
	elif odd == 0 or even == 0:
		print('NO')
	else:
		print('YES')


n = int(input())
for i in range(n):
	j = 0
	m = int(input())
	a = list(map(int, input().split()))
	for k in range(m):
		if a[k] % 2 == 1:
			j = j + 1
	if j == 0:
		print('NO')
	elif m % 2 == 0 and m == j:
		print('NO')
	else:
		print('YES')


test = int(input())
for i in range(test):
	n = int(input())
	l = input().split()
	l = [int(i) for i in l]
	even = 0
	odd = 0
	for i in l:
		if i % 2 == 0:
			even += 1
		else:
			odd += 1
	if even == n:
		print('NO')
	elif even == 0 and odd % 2 == 0:
		print('NO')
	else:
		print('YES')


for t in range(int(input())):
	n = int(input())
	ar = [int(num) for num in input().split(' ')]
	count = 0
	lenofar = len(ar)
	for h in ar:
		if h % 2 != 0:
			count = count + 1
	if count % 2 != 0 or (count < lenofar and count != 0):
		print('Yes')
	else:
		print('No')


n = int(input())
for i in range(n):
	a = int(input())
	b = list(map(int, input().split()))[:a]
	(odd, even) = (0, 0)
	for j in range(len(b)):
		if b[j] % 2 == 0:
			even += 1
		else:
			odd += 1
	if odd == 0 or (even == 0 and a % 2 == 0):
		print('NO')
	else:
		print('YES')


y = int(input())
i = 0
while i < y:
	a = int(input())
	riga = list(map(int, input().strip().split()))
	totale = riga[0]
	x = 1
	while x < a:
		totale = totale + riga[x]
		x = x + 1
	if totale % 2 != 0:
		print('YES')
	else:
		x = 1
		if riga[0] % 2 == 0:
			risultato = True
		else:
			risultato = False
		d = risultato
		while x < a:
			if riga[x] % 2 == 0:
				risultato = True
			else:
				risultato = False
			if risultato != d:
				print('YES')
				break
			x = x + 1
		if risultato == d:
			print('NO')
	i = i + 1


def main():

	def solve():
		n = int(input())
		aa = [int(a) for a in input().split()]
		ocount = 0
		for a in aa:
			if a % 2 == 1:
				ocount += 1
		if ocount % 2 == 1 or (ocount > 0 and ocount < n):
			print('YES')
		else:
			print('NO')
	q = int(input())
	for _ in range(q):
		solve()
main()


for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if sum(a) % 2 == 1:
		print('YES')
	else:
		for o in range(n):
			a[o] = a[o] % 2
		if a.count(1) > 0 and a.count(0) > 0:
			print('YES')
		else:
			print('NO')


for _ in range(int(input())):
	n = int(input())
	lst = list(map(int, [int(i) for i in input().split()]))
	cont_odd = False
	cont_even = False
	for i in range(n):
		if lst[i] % 2 == 0:
			cont_even = True
		else:
			cont_odd = True
	if cont_odd and cont_even:
		print('YES')
	elif cont_even:
		print('NO')
	else:
		print('YES' if n % 2 else 'NO')


t = int(input())
for _ in range(t):
	_ = int(input())
	a = [int(i) for i in input().split()]
	if sum(a) % 2 == 1:
		print('YES')
	else:
		x = list(filter(lambda x: x % 2 == 0, a))
		y = list(filter(lambda x: x % 2 == 1, a))
		if x and y:
			print('YES')
		else:
			print('NO')


for _ in range(int(input())):
	n = int(input())
	a = [int(i) for i in input().split()]
	if sum(a) % 2 == 1:
		print('YES')
	else:
		par = False
		impar = False
		for i in a:
			if i % 2 == 0:
				par = True
			else:
				impar = True
		if par and impar:
			print('YES')
		else:
			print('NO')


for i in range(int(input())):
	n = int(input())
	l = [int(i) % 2 for i in input().split()]
	if sum(l) % 2 != 0:
		print('YES')
	elif len(set(l)) == 1:
		print('NO')
	else:
		print('YES')


t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split(' ')))
	if sum(l) % 2 != 0:
		print('YES')
	else:
		chk = 0
		for x in range(n):
			if l[x] % 2 == 0:
				for y in range(n):
					if x != y:
						if l[y] % 2 != 0:
							chk = 1
				if chk == 1:
					break
		if chk == 1:
			print('YES')
		else:
			print('NO')


t = int(input())
for i in range(t):
	x = int(input())
	l = list(map(int, input().split()))
	o = e = 0
	for i in range(x):
		if l[i - 1] % 2 == 0:
			e += 1
		else:
			o += 1
	print('NO') if o == 0 or (e == 0 and x % 2 == 0) else print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	even = 0
	odd = 0
	sum_arr = sum(arr)
	for j in range(n):
		if arr[j] % 2 != 0:
			odd += 1
		else:
			even += 1
	if sum_arr % 2 != 0:
		print('YES')
	elif odd != 0 and even != 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for zz in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	if sum(l) % 2 == 1:
		print('YES')
	else:
		(a, b) = (0, 0)
		for i in range(n):
			if l[i] % 2 == 0:
				a += 1
			else:
				b += 1
		if b == n:
			if b % 2 == 0:
				print('NO')
			else:
				print('YES')
		elif b > 0:
			print('YES')
		else:
			print('NO')


def cop(A):
	n = len(A)
	z = f = 0
	for i in A:
		if i % 2 == 0:
			z += 1
		else:
			f += 1
	if z >= 1 and f >= 1:
		print('YES')
	elif z == 0 and n % 2 == 1:
		print('YES')
	else:
		print('NO')
	return
t = int(input())
for tt in range(t):
	x = int(input())
	A = list(map(int, input().strip().split(' ')))
	cop(A)


t = int(input())
for _ in range(t):
	n = int(input())
	lst = list(map(int, input().split(' ', n - 1)))
	odd_lst = list(filter(lambda x: x % 2 != 0, lst))
	even_lst = list(filter(lambda x: x % 2 == 0, lst))
	if len(odd_lst) == 0 or (len(even_lst) == 0 and len(odd_lst) % 2 == 0):
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	odd = 0
	even = 0
	for i in arr:
		if i % 2 == 1:
			odd += 1
		else:
			even += 1
	if odd % 2 == 1:
		print('YES')
	elif odd % 2 == 0 and even >= 1 and (odd >= 1):
		print('YES')
	else:
		print('NO')


pt = int(input())
for i in range(pt):
	pn = int(input())
	df = list(map(int, input().split()))
	(eve, odd) = (0, 0)
	for j in df:
		if j % 2 == 0:
			eve += 1
		else:
			odd += 1
	if odd == 0 or (eve == 0 and pn % 2 == 0):
		print('NO')
	else:
		print('YES')


for iii in range(int(input())):
	n = int(input())
	q = list(map(int, input().split()))
	odd = 0
	ev = 0
	for i in q:
		if i % 2 == 0:
			ev += 1
		else:
			odd += 1
	if odd == 0:
		print('NO')
	elif ev == 0 and n % 2 == 0:
		print('NO')
	else:
		print('YES')


import sys
input = sys.stdin.readline
scan_int = lambda : int(input())
scan_string = lambda : input()
read_list = lambda : list(read())
read = lambda : map(int, input().split())
read_float = lambda : map(float, input().split())

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def factorial(x, m):
	val = 1
	while x > 0:
		val = val * x % m
		x -= 1
	return val

def fact(x):
	val = 1
	while x > 0:
		val *= x
		x -= 1
	return val

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b // math.gcd(a, b)

def nCr(n, k):
	if k > n:
		return 0
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res)

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	(prime[0], prime[1]) = (False, False)
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime

def phi(n):
	result = n
	p = 2
	while p * p <= n:
		if n % p == 0:
			while n % p == 0:
				n = n // p
			result = result * (1.0 - 1.0 / float(p))
		p = p + 1
	if n > 1:
		result = result * (1.0 - 1.0 / float(n))
	return int(result)

def is_prime(n):
	if n == 0:
		return False
	if n == 1:
		return True
	for i in range(2, int(n ** (1 / 2)) + 1):
		if not n % i:
			return False
	return True

def next_prime(n, primes):
	while primes[n] != True:
		n += 1
	return n
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i
spf = [0 for i in range(MAXN)]

def factoriazation(x):
	res = []
	for i in range(2, int(x ** 0.5) + 1):
		while x % i == 0:
			res.append(i)
			x //= i
	if x != 1:
		res.append(x)
	return res

def factors(n):
	res = []
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			res.append(i)
			res.append(n // i)
	return list(set(res))

def int_array():
	return list(map(int, input().strip().split()))

def float_array():
	return list(map(float, input().strip().split()))

def str_array():
	return input().strip().split()

def binary_search(low, high, w, h, n):
	while low < high:
		mid = low + (high - low) // 2
		if check(mid, w, h, n):
			low = mid + 1
		else:
			high = mid
	return low

def check(beauty, s, n, count):
	pass
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
from itertools import permutations
import math
import bisect as bis
import random
import sys

def solve():
	n = scan_int()
	even = 0
	odd = 0
	a = read_list()
	for x in a:
		if x % 2 == 0:
			even += 1
		else:
			odd += 1
	if even == n or (odd == n and odd % 2 == 0):
		print('NO')
	else:
		print('YES')
for _ in range(int(input())):
	solve()


def rMap():
	return map(int, input().split())

def rList():
	return list(map(int, input().split()))
t = int(input())
for i in range(t):
	n = int(input())
	a = rList()
	countA = 0
	countB = 0
	for i in a:
		if i % 2 == 0:
			countA += 1
		else:
			countB += 1
	if countA == 0:
		if n % 2 == 1:
			print('YES')
		else:
			print('NO')
	elif countB == 0:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	imp = False
	p = False
	s = 0
	for i in l:
		s += i
		if i % 2 == 1 and (not imp):
			imp = True
		if i % 2 == 0 and (not p):
			p = True
	if s % 2 == 1 or (imp and p):
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(i) % 2 for i in input().split()]
	if a.count(0) == n or (a.count(1) == n and n % 2 == 0):
		print('NO')
		continue
	print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	ch = input()
	L = [int(i) for i in ch.split()]
	nbp = 0
	nbimp = 0
	for i in L:
		if i % 2 == 0:
			nbp += 1
		else:
			nbimp += 1
	if n % 2 == 0:
		if nbp > 0 and nbimp > 0:
			print('YES')
		else:
			print('NO')
	elif nbimp > 0:
		print('YES')
	else:
		print('NO')


T = int(input())
t = 0
while t < T:
	N = int(input())
	L = list(map(int, input().split()))
	n = 0
	somma = 0
	ri = L[0] % 2
	u = True
	while n < N:
		somma += L[n]
		if L[n] % 2 != ri:
			u = False
			break
		n += 1
	if somma % 2 == 1:
		print('YES')
	if somma % 2 == 0 and u == False:
		print('YES')
	if somma % 2 == 0 and u == True:
		print('NO')
	t += 1


t = int(input())
st = set()
for i in range(t):
	n = int(input())
	lst = list(map(int, input().split()))
	(od, ev, sum) = (0, 0, 0)
	for el in lst:
		sum += el
		if el % 2 == 0:
			ev += 1
		else:
			od += 1
	if sum & 1 or (sum % 2 == 0 and od > 0 and (ev > 0)):
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	a = int(input())
	n = 0
	m = 0
	b = list(map(int, input().split()))
	for i in b:
		if i % 2 == 1:
			n += 1
		else:
			m += 1
	print('YNEOS'[not (n > 0 and m > 0 or n % 2 == 1)::2])


for i in range(int(input())):
	int(input())
	a = list(map(int, input().split()))
	odd = 0
	for j in a:
		if j % 2 != 0:
			odd += 1
	if odd > 0:
		if odd == len(a):
			if len(a) % 2 != 0:
				print('YES')
			else:
				print('NO')
		else:
			print('YES')
	else:
		print('NO')


import sys

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def get_array():
	return list(map(int, sys.stdin.readline().strip().split()))

def input():
	return sys.stdin.readline().strip()
t = int(input())
for tt in range(t):
	n = int(input())
	arr = get_array()
	a1 = int(0)
	a2 = int(0)
	for v in arr:
		if v % 2 == 1:
			a1 += 1
		else:
			a2 += 1
	if a1 > 0 and a2 > 0:
		print('YES')
	elif a1 % 2 == 1:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	(odd, even) = (False, False)
	for i in a:
		if i % 2 == 0:
			even = True
		else:
			odd = True
		if odd and even:
			print('YES')
			break
	else:
		if odd and (not even) and (n % 2 == 1):
			print('YES')
		else:
			print('NO')


s = int(input())
rs = []
for i in range(s):
	a = int(input())
	b = list(map(int, input().split()))
	(count, sm) = (0, 0)
	for val in b:
		if val % 2 != 0:
			count += 1
		sm += val
	if sm % 2 != 0:
		rs.append('YES')
	elif count > 0 and count < a:
		rs.append('YES')
	else:
		rs.append('NO')
for i in rs:
	print(i)


def solve():
	test_cases = int(input())
	for i in range(test_cases):
		n = int(input())
		(sum_num, odd, even) = (0, 0, 0)
		arr = str(input()).split()[:n]
		arr = list(map(int, arr))
		for j in range(len(arr)):
			if arr[j] % 2 != 0 or arr[j] == 1:
				odd += 1
			else:
				even += 1
			sum_num += arr[j]
		if sum_num % 2 != 0 or sum_num == 1:
			print('YES')
		elif odd != 0 and even != 0:
			print('YES')
		else:
			print('NO')
solve()


import math
t = int(input())
for i in range(t):
	n = int(input())
	li = []
	li[:n] = map(int, input().split())
	oddcount = 0
	evecount = 0
	flag = 0
	if len(li) == 1:
		if li[0] % 2 == 1:
			print('YES')
		else:
			print('NO')
	else:
		for j in li:
			if j % 2 == 0:
				if oddcount != 0:
					print('YES')
					flag = 1
					break
				evecount += 1
			else:
				if evecount != 0:
					print('YES')
					flag = 1
					break
				oddcount += 1
		if flag == 0:
			if oddcount % 2 == 1:
				print('YES')
			else:
				print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	evens = 0
	odds = 0
	for i in a:
		if i & 1:
			odds += 1
		else:
			evens += 1
	if odds & 1:
		print('YES')
	elif evens > 0 and odds > 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	a = int(input())
	watch = input()
	isEven = False
	isOdd = False
	watch.split(' ')
	lists = []
	for val in watch.split(' '):
		lists.append(int(val))
	for i in lists:
		if i % 2 == 0:
			isEven = True
		else:
			isOdd = True
	if sum(lists) % 2 == 0:
		if isEven and isOdd:
			print('YES')
		else:
			print('NO')
	else:
		print('YES')
	lists.clear()


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	cnt_chan = cnt_le = 0
	for i in range(n):
		if a[i] % 2 == 0:
			cnt_chan += 1
		else:
			cnt_le += 1
	if cnt_chan == 0 and len(a) % 2 == 0 or cnt_le == 0:
		print('NO')
	else:
		print('YES')


n = int(input())
for _ in range(n):
	l = int(input())
	a = input().split(' ')
	arr = [int(x) for x in a]
	o = 0
	sm = 0
	for num in arr:
		sm = sm + num
		if num % 2:
			o = o + 1
	e = l - o
	if sm % 2:
		print('YES')
	elif o % 2:
		print('YES')
	elif e > 0 and o > 0:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	N = int(input())
	a = list(map(int, input().split()))
	sum_ = 0
	for i in range(N):
		sum_ += a[i]
	if sum_ % 2 == 1:
		print('YES')
	else:
		(even, odd) = (False, False)
		for i in range(N):
			if a[i] % 2 == 1:
				odd = True
			else:
				even = True
		if not even or not odd:
			print('NO')
		else:
			print('YES')


t = int(input())
for _ in range(t):
	n = int(input())
	ali = list(map(int, input().split()))
	f = 0
	q = sum(ali)
	if q % 2 == 0:
		o = 0
		e = 0
		for i in ali:
			if i % 2 != 0:
				o += 1
			else:
				e += 1
		if o == n:
			print('NO')
		elif e == n:
			print('NO')
		else:
			print('YES')
	else:
		print('YES')


t = int(input())
for i in range(0, t):
	n = int(input())
	a = input().split()
	oddCount = evenCount = 0
	for i in range(0, n):
		a[i] = int(a[i]) % 2
		if a[i] == 1:
			oddCount += 1
		else:
			evenCount += 1
	if oddCount == 0 or (evenCount == 0 and n % 2 == 0):
		print('NO')
	else:
		print('YES')


def solve(n, m):
	even = odd = 0
	for i in range(n):
		if m[i] % 2 == 0:
			even += 1
		else:
			odd += 1
	if odd == 0 or (even == 0 and odd % 2 == 0):
		return 'NO'
	else:
		return 'YES'
for _ in range(int(input())):
	(n, m) = (int(input()), list(map(int, input().split())))
	print(solve(n, m))


t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	e = 0
	o = 0
	s = 0
	for j in arr:
		s += j
		if j % 2 == 0:
			e += 1
		else:
			o += 1
	if s % 2 == 0:
		if e == n or o == n:
			print('NO')
		else:
			print('YES')
	else:
		print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	e = 0
	o = 0
	f = 0
	for i in l:
		if i % 2 == 0:
			e = e + 1
		else:
			o = o + 1
	if o > 0:
		if o == n and n % 2 == 0:
			print('NO')
		else:
			print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	cnt_odd = sum([1 for i in arr if i % 2 == 1])
	cnt_even = sum([1 for i in arr if i % 2 == 0])
	if cnt_odd > 0 and cnt_even > 0:
		print('YES')
	elif cnt_odd == n and sum(arr) % 2 == 1:
		print('YES')
	else:
		print('NO')


t = int(input())
for l in range(t):
	input()
	ls = list(map(int, input().split()))
	cnt = cnt2 = 0
	if sum(ls) % 2 != 0:
		print('YES')
	else:
		for m in ls:
			if m % 2 == 0:
				cnt = 1
			else:
				cnt2 = 1
		if cnt == 1 and cnt2 == 1:
			print('YES')
		else:
			print('NO')


t = int(input())
for t in range(t):
	n = int(input())
	arr = [int(i) for i in input().split()]
	if sum(arr) % 2 == 0:
		oddEl = False
		evenEl = False
		i = 0
		while not (oddEl == True and evenEl == True) and i < len(arr):
			if arr[i] % 2 != 0:
				oddEl = True
				i += 1
			else:
				evenEl = True
				i += 1
		print(['NO', 'YES'][oddEl == True and evenEl == True])
	else:
		print('YES')


import sys

def main():
	for _ in range(int(sys.stdin.readline())):
		n = int(sys.stdin.readline())
		l = [int(x) for x in sys.stdin.readline().split()]
		ev = 0
		od = 0
		for i in l:
			if i % 2 == 0:
				ev += 1
			else:
				od += 1
		if ev == n:
			print('NO')
		elif od == n:
			if n % 2 == 0:
				print('NO')
			else:
				print('YES')
		else:
			print('YES')
main()


for i in range(int(input())):
	k = int(input())
	a = list(map(int, input().split()))
	(c, d, m) = (0, 0, 0)
	for i in a:
		if i % 2 != 0:
			c += 1
		else:
			d += 1
	if sum(a) % 2 != 0:
		m = 1
		print('YES')
	elif len(a) % 2 != 0 and d > 0 and (c > 0):
		print('YES')
		m = 1
	elif len(a) % 2 == 0 and c > 0 and (d > 0):
		print('YES')
		m = 1
	if m == 0:
		print('NO')


n = int(input())
for i in range(n):
	m = int(input())
	p = list(map(int, input().split()))
	if sum(p) % 2 != 0:
		print('YES')
	else:
		s = 0
		f = 0
		for j in range(len(p)):
			if p[j] % 2 != 0:
				s = 1
			else:
				f = 1
		if s - f == 0:
			print('YES')
		else:
			print('NO')


n = int(input())
for i in range(n):
	num = int(input())
	lst = list(map(int, input().split()))
	even = 0
	odd = 0
	for j in lst:
		if j % 2 == 0:
			even += 1
		else:
			odd += 1
	if odd == 0 or (odd == num and num % 2 == 0):
		print('NO')
	else:
		print('YES')


for p in range(int(input())):
	n = int(input())
	a = [int(s) for s in input().split()]
	k = 0
	for i in a:
		if i % 2 != 0:
			k += 1
	if k == 0:
		print('NO')
	elif k == n and n % 2 == 0:
		print('NO')
	else:
		print('YES')


t = int(input())
anss = [''] * t
for i in range(t):
	n = int(input())
	a = list(map(lambda o: int(o) % 2, input().split()))
	if sum(a) % 2 == 1:
		anss[i] = 'YES'
	elif a.count(0) and a.count(1):
		anss[i] = 'YES'
	else:
		anss[i] = 'NO'
for ans in anss:
	print(ans)


for _ in range(int(input())):
	n = int(input())
	A = list(map(int, input().split()))
	(c1, c2) = (0, 0)
	for i in A:
		if i % 2:
			c1 += 1
		else:
			c2 += 1
	if c1 == 0:
		print('NO')
	elif c2 == 0:
		if n % 2:
			print('YES')
		else:
			print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	if sum(arr) % 2 == 1:
		print('YES')
	elif all((ele % 2 == 0 for ele in arr)):
		print('NO')
	elif all((ele % 2 == 1 for ele in arr)) and len(arr) % 2 == 0:
		print('NO')
	else:
		print('YES')


s = input()
while True:
	try:
		s = input()
		l = list(map(int, input().split(' ')))
		if sum(l) % 2 == 0:
			odd = False
			even = False
			for i in l:
				if i % 2 == 0:
					odd = True
				else:
					even = True
			if odd and even:
				print('YES')
			else:
				print('NO')
		else:
			print('YES')
	except:
		break


n = int(input())
for x in range(n):
	a = int(input())
	b = list(map(int, input().split()))
	e = o = 0
	for i in range(a):
		if b[i] % 2 == 0:
			e += 1
		else:
			o += 1
	if o == 0 or (e == 0 and o % 2 == 0):
		print('NO')
	else:
		print('YES')


import math, collections, sys
input = sys.stdin.readline
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	oc = 0
	for i in a:
		oc += i % 2
	if oc:
		if oc % 2:
			print('YES')
		elif n - oc:
			print('YES')
		else:
			print('NO')
	else:
		print('NO')


for i in range(int(input())):
	(n, L) = (int(input()), list(map(int, input().split())))
	count = 0
	for i in range(len(L)):
		if L[i] & 1 != 0:
			count += 1
	if count & 1 != 0:
		print('YES')
	elif count & 1 == 0 and count != len(L) and (count != 0):
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	even = 0
	odd = 0
	for i in a:
		if i % 2 == 0:
			even = even + 1
		else:
			odd = odd + 1
	if even == n:
		print('NO')
	elif odd == n and n % 2 == 0:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	input()
	l = [int(x) for x in input().split()]
	ec = 0
	oc = 0
	s = 0
	for x in l:
		s += x
		if x % 2:
			oc += 1
		else:
			ec += 1
	if s % 2 == 1 or (oc > 0 and ec > 0):
		print('YES')
	else:
		print('NO')


def odd_even(arr):
	(odds, evens) = (0, 0)
	for i in arr:
		if i % 2 == 0:
			evens += 1
		else:
			odds += 1
	return (odds, evens)
for _ in range(int(input())):
	arr_size = int(input())
	arr = list(map(int, input().split()))
	(odds, evens) = odd_even(arr)
	if arr_size % 2 == 0:
		if odds == 0:
			print('NO')
		elif odds == arr_size:
			print('NO')
		else:
			print('YES')
	elif odds == 0:
		print('NO')
	else:
		print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	l = input().split()
	f = 0
	m = 0
	for j in l:
		if int(j) % 2 == 0:
			f = 1
		if int(j) % 2 != 0:
			m = 1
	if n % 2 == 0:
		if m == 1 and f == 1:
			print('YES')
		else:
			print('NO')
	elif m == 1:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	s = input()
	l = s.split()
	su = 0
	for j in l:
		su += int(j)
	if su % 2 != 0:
		print('YES')
	else:
		c = 0
		c1 = 0
		for j in l:
			if int(j) % 2 == 0:
				c += 1
			else:
				c1 += 1
		if c == 0 or c1 == 0:
			print('NO')
		else:
			print('YES')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if sum(a) % 2 == 1:
		print('YES')
	else:
		odd = 0
		even = 0
		for x in a:
			if x % 2 == 0:
				even += 1
			else:
				odd += 1
		if even >= 1 and odd >= 1:
			print('YES')
		else:
			print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if sum(a) % 2 == 1:
		print('YES')
	else:
		x = a[0] % 2
		for i in a:
			if i % 2 != x:
				print('YES')
				break
		else:
			print('NO')


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	c = 0
	for i in l:
		if i % 2 == 1:
			c += 1
	if c == 0:
		print('NO')
		continue
	if c == len(l) and c & 1 == 0:
		print('NO')
		continue
	print('YES')


import math
from decimal import Decimal
import heapq
import copy
import heapq
from collections import deque

def na():
	n = int(input())
	b = [int(x) for x in input().split()]
	return (n, b)

def nab():
	n = int(input())
	b = [int(x) for x in input().split()]
	c = [int(x) for x in input().split()]
	return (n, b, c)

def dv():
	(n, m) = list(map(int, input().split()))
	return (n, m)

def da():
	(n, m) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	return (n, m, a)

def dva():
	(n, m) = list(map(int, input().split()))
	a = [int(x) for x in input().split()]
	b = [int(x) for x in input().split()]
	return (n, m, b)

def eratosthenes(n):
	sieve = list(range(n + 1))
	for i in sieve:
		if i > 1:
			for j in range(i + i, len(sieve), i):
				sieve[j] = 0
	return sorted(set(sieve))

def lol(lst, k):
	k = k % len(lst)
	ret = [0] * len(lst)
	for i in range(len(lst)):
		if i + k < len(lst) and i + k >= 0:
			ret[i] = lst[i + k]
		if i + k >= len(lst):
			ret[i] = lst[i + k - len(lst)]
		if i + k < 0:
			ret[i] = lst[i + k + len(lst)]
	return ret

def nm():
	n = int(input())
	b = [int(x) for x in input().split()]
	m = int(input())
	c = [int(x) for x in input().split()]
	return (n, b, m, c)

def dvs():
	n = int(input())
	m = int(input())
	return (n, m)

def fact(n):
	tc = []
	ans = {}
	d = 2
	while d * d <= n:
		if n % d == 0:
			tc.append(d)
			n //= d
		else:
			d += 1
	if n > 1:
		tc.append(n)
	for i in tc:
		ans[i] = ans.get(i, 0) + 1
	return ans
for i in range(int(input())):
	(n, a) = na()
	nech = 0
	s = 0
	for j in a:
		if j % 2 == 1:
			nech += 1
		s += j
	if s % 2 == 1:
		print('YES')
		continue
	if nech == n or nech == 0:
		print('NO')
	else:
		print('YES')


for a in range(int(input())):
	n = int(input())
	L = list(map(int, input().split()))
	S = []
	for i in L:
		S.append(i % 2)
	if sum(S) == 0 or (sum(S) == n and n % 2 == 0):
		print('NO')
	else:
		print('YES')


for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	k = 0
	d = 0
	for i in range(n):
		if l[i] % 2 == 0:
			k += 1
		if l[i] % 2 != 0:
			d += 1
	if k == n:
		print('NO')
	elif d == n and n % 2 == 0:
		print('NO')
	else:
		print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	a = [int(item) for item in input().split(' ')]
	count_o = 0
	count_e = 0
	for j in a:
		if j % 2 == 0:
			count_e += 1
		else:
			count_o += 1
	if sum(a) % 2 == 0:
		if count_e == n or count_o == n:
			print('NO')
		else:
			print('YES')
	else:
		print('YES')


t = int(input())
for _ in range(t):
	n = int(input())
	it = list(map(int, input().split()))
	s = [i for i in it if i % 2 == 1]
	if len(s) >= 1 and (len(s) < n or n % 2 == 1):
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	f = 0
	e = 0
	o = 0
	for i in range(n):
		if a[i] % 2 == 1:
			o += 1
		else:
			e += 1
	if o % 2 == 1:
		print('YES')
	elif e > 0 and o > 0:
		print('YES')
	else:
		print('NO')


n = int(input())
for tc in range(n):
	x = int(input())
	a = list(map(int, input().split()))
	odds = 0
	evens = 0
	for i in range(x):
		if a[i] % 2 == 0:
			evens += 1
		else:
			odds += 1
	if odds == 0:
		print('NO')
	elif evens == 0 and odds % 2 == 0:
		print('NO')
	elif odds % 2 == 1:
		print('YES')
	elif evens > 0 and odds % 2 == 0:
		print('YES')


t = int(input())
while t != 0:
	t -= 1
	n = int(input())
	s = input().split(' ')
	s = list(map(int, s))
	contp = 0
	conti = 0
	for x in s:
		if x % 2 == 0:
			contp += 1
		else:
			conti += 1
	if sum(s) % 2 != 0:
		print('YES')
	elif 1 < conti < len(s):
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	arr = [int(i) for i in input().split()]
	n0 = 0
	n1 = 0
	for i in arr:
		if i % 2 == 0:
			n0 += 1
		else:
			n1 += 1
	if n1 % 2 != 0:
		print('YES')
	elif n1 != n and n1 != 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	n = int(input())
	a = [int(j) for j in input().split()]
	q = sum((1 for k in a if k & 1))
	print(('NO', 'YES')[0 < q < n or (0 < q <= n and n & 1)])


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	sum1 = 0
	odd = 0
	for i in range(n):
		if l[i] % 2 != 0:
			odd += 1
		sum1 += l[i]
	print
	if sum1 % 2 != 0 or (sum1 % 2 == 0 and odd >= 1 and (odd != n)):
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	n = int(input())
	nums = list(map(int, input().split()))
	numOdds = 0
	for num in nums:
		if num % 2 == 1:
			numOdds += 1
	if numOdds % 2 == 1:
		print('YES')
	elif numOdds == 0:
		print('NO')
	elif numOdds == n:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	length = int(input())
	odd = 0
	for number in input().split():
		if int(number) & 1:
			odd += 1
	if odd == 0:
		print('NO')
	elif odd == length and (not length & 1):
		print('NO')
	else:
		print('YES')


for (n, arr) in [[input(), [int(x) for x in input().split()]] for _ in ' ' * int(input())]:
	condition = [len(arr) % 2 == 0 and sum((x % 2 for x in arr)) == len(arr), sum((x % 2 for x in arr)) == 0]
	print('YNEOS'[True in condition::2])


t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	od = 0
	for i in a:
		if i % 2 == 1:
			od += 1
	if sum(a) % 2 == 1:
		print('YES')
	elif n == od or od == 0:
		print('NO')
	else:
		print('YES')


t = int(input())
for _ in range(0, t):
	n = int(input())
	l = list(map(int, input().split()))
	o = 0
	for i in l:
		if i % 2 != 0:
			o += 1
	if o == n and n % 2 == 0:
		print('NO')
	elif o == 0:
		print('NO')
	elif o == n and n % 2 != 0:
		print('YES')
	elif o % 2 == 0 and o != n:
		print('YES')
	elif o % 2 == 1:
		print('YES')


import sys

def query():
	n = int(input())
	a = [int(x) for x in input().split()]
	if n % 2 == 1:
		for x in a:
			if x % 2 == 1:
				print('YES')
				break
		else:
			print('NO')
	else:
		odd = 0
		for x in a:
			odd += x % 2
		if 0 < odd < n:
			print('YES')
		else:
			print('NO')
q = int(input())
for i in range(0, q):
	query()


def iinput():
	return [int(x) for x in input().split()]

def main():
	n = int(input())
	data = iinput()
	count = 0
	for i in range(n):
		if data[i] % 2 == 1:
			count += 1
	if count == 0 or (count == n and n % 2 == 0):
		return 'NO'
	else:
		return 'YES'
for t in range(int(input())):
	print(main())


for _ in range(int(input())):
	n = int(input())
	s = list(map(int, input().split()))
	f = 0
	if n % 2:
		k = 0
		for i in s:
			if i % 2 == 0:
				k += 1
		if k == n:
			f = 1
	else:
		k = 0
		for i in s:
			if i % 2:
				k += 1
		if k == n or k == 0:
			f = 1
	if f:
		print('NO')
	else:
		print('YES')


def func(n):
	for i in range(n):
		k = int(input())
		l = list(map(int, input().split()))
		odd = 0
		even = 0
		if sum(l) % 2 != 0:
			print('YES')
			continue
		for i in l:
			if i % 2 == 0:
				even += 1
			else:
				odd += 1
		if even == len(l):
			print('NO')
		elif odd == len(l):
			print('NO')
		else:
			print('YES')
n = int(input())
func(n)


n = int(input())
for i in range(n):
	x = int(input())
	a = [int(j) for j in input().split()]
	o = 0
	for i in a:
		if i % 2 != 0:
			o += 1
	if x == o and o % 2 == 0 or o == 0:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	n = int(input())
	a = list(map(lambda x: int(x) % 2, input().split()))
	if sum(a) % 2:
		print('YES')
		continue
	if len(set(a)) == 1:
		if a[0] * n % 2:
			print('YES')
		else:
			print('NO')
		continue
	print('YES')


n = int(input())
i = 0
ans = []
while i < n:
	x = int(input())
	aa = len([i for i in map(int, input().split()) if i % 2 != 0])
	if aa == 0 or aa % 2 == 0:
		if aa == x or aa == 0:
			ans.append('NO')
		else:
			ans.append('YES')
	else:
		ans.append('YES')
	i += 1
for i in ans:
	print(i)


t = int(input())
for i in range(t):
	n = int(input())
	list1 = list(map(int, input().split()))
	length1 = len(list1)
	list2 = []
	list3 = []
	variable = 0
	for i in list1:
		if i % 2 == 0:
			list2.append(i)
		else:
			list3.append(i)
	if length1 % 2 != 0:
		if len(list3) != 0:
			print('YES')
		else:
			print('NO')
	elif len(list3) == 0 or len(list2) == 0:
		print('NO')
	else:
		print('YES')


def Input():
	tem = input().split()
	ans = []
	for it in tem:
		ans.append(int(it))
	return ans
from collections import Counter
T = Input()[0]
for tt in range(T):
	n = Input()[0]
	a = Input()
	(odd, even, total) = (0, 0, 0)
	for i in range(n):
		if a[i] % 2 == 0:
			even += 1
		else:
			odd += 1
		total += a[i]
	if total % 2 == 1 or (even > 0 and odd > 0):
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	s = len([0 for x in map(int, input().split()) if x % 2 != 0])
	print('NO' if s == 0 or (s == n and n % 2 == 0) else 'YES')


import sys, bisect, copy, heapq
from collections import defaultdict, Counter, deque
from functools import lru_cache

def input():
	return sys.stdin.readline()

def print(arg, *argv, end=None):
	sys.stdout.write(str(arg))
	for i in argv:
		sys.stdout.write(' ' + str(i))
	sys.stdout.write(end) if end or end == '' else sys.stdout.write('\n')

def mapi():
	return map(int, input().split())

def maps():
	return map(str, input().split())

def solve():
	t = 1
	t = int(input())
	for _ in range(t):
		n = int(input())
		a = list(mapi())
		sm = sum(a)
		if sm % 2 == 1:
			print('YES')
		else:
			flag = False
			cnt = 0
			for i in range(n):
				if a[i] % 2 == 1:
					cnt += 1
					flag = True
			if flag and cnt != n:
				print('YES')
			else:
				print('NO')
solve()


for _ in range(int(input())):
	n = int(input())
	ar = list(map(int, input().split()))
	(a, b) = (0, 0)
	for elem in ar:
		if elem % 2 == 0:
			a = 1
		else:
			b = 1
	if sum(ar) % 2 == 1:
		print('YES')
	elif a == 1 == b:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	a = int(input())
	b = list(map(int, input().split()))
	if sum(b) % 2:
		print('YES')
	else:
		e = o = 0
		for i in range(a):
			if b[i] % 2:
				o += 1
			else:
				e += 1
		if o == 0 or e == 0:
			print('NO')
		else:
			print('YES')


def line():
	return map(int, input().split())

def num():
	return int(input())
from itertools import repeat
t = num()
for _ in repeat(None, t):
	n = num()
	a = list(line())
	q = a[0] % 2
	if any((w % 2 != q for w in a[1:])) or sum(a) % 2:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	l = [*map(int, input().split())]
	odd = 0
	for i in range(n):
		if l[i] % 2 == 1:
			odd += 1
	if odd == n and n % 2 == 0:
		print('NO')
	elif odd == 0:
		print('NO')
	else:
		print('YES')


t = int(input())
while t:
	t -= 1
	n = int(input())
	a = list(map(int, input().split()))
	co = 0
	for i in a:
		if i % 2:
			co += 1
	if co == n and n % 2 == 0 or co == 0:
		print('NO')
	else:
		print('YES')


I = input
for _ in [0] * int(I()):
	n = int(I())
	o = sum((int(x) % 2 for x in I().split()))
	print('NYOE S'[0 < o < n + n % 2::2])


n = int(input())
Result = []
for i in range(0, n):
	even = 0
	odd = 0
	len_ = int(input())
	List = list(map(int, input().strip().split()))[0:len_]
	for i in range(0, len_):
		if List[i] % 2 == 0:
			even += 1
		else:
			odd += 1
	if even > 0:
		if odd > 0:
			Result.append('YES')
		else:
			Result.append('NO')
	elif odd % 2 == 0:
		Result.append('NO')
	else:
		Result.append('YES')
for i in Result:
	print(i)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	s = sum(a)
	if s % 2:
		print('YES')
	else:
		even = -1
		odd = -1
		for x in a:
			if x & 1:
				odd = x
			else:
				even = x
		print('YNEOS'[even == -1 or odd == -1::2])


t = int(input())
ans = 0
d = 0
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if sum(a) % 2 == 1:
		print('YES')
		ans += 1
	elif ans == 0:
		for j in range(n):
			if a[j] % 2 == 1:
				d += 1
		if d != n and d != 0:
			print('YES')
		else:
			print('NO')
	ans = 0
	d = 0


t = int(input())
for i in range(t):
	input()
	ary = list(map(int, input().split()))
	if sum(ary) % 2 != 0:
		print('YES')
	else:
		e = 0
		o = 0
		for i in ary:
			if i % 2 == 0:
				e += 1
			else:
				o += 1
		if o == 0 or o == len(ary):
			print('NO')
		else:
			print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	m = input().split()
	a = [int(i) for i in m]
	odd = 0
	even = 0
	for j in a:
		if j % 2 == 0:
			even += j
		else:
			odd += j
	if sum(a) % 2 == 1:
		print('YES')
	elif odd > 1 and even > 1:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	s = sum(a)
	if s % 2 != 0:
		print('YES')
	else:
		t = list(filter(lambda x: x % 2 == 0, a))
		if 0 < len(t) < n:
			print('Yes')
		else:
			print('NO')


I = input
for _ in [0] * int(I()):
	I()
	a = s = 0
	b = 1
	for x in I().split():
		x = int(x) & 1
		a |= x
		b &= x
		s ^= x
	print('YNEOS'[a < 1 or 0 < b > s::2])


t = int(input())
for i in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	ni = 0
	chi = 0
	for j in range(len(a)):
		if a[j] % 2 == 0:
			chi = 1
		else:
			ni = 1
	if ni == chi:
		print('YES')
		continue
	if ni == 1 and len(a) % 2 == 1:
		print('YES')
		continue
	else:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	a = False
	if l[0] % 2 == 0:
		for i in l:
			if i % 2 == 1:
				a = True
	elif l[0] % 2 == 1 and len(l) % 2 == 1:
		a = True
	else:
		for i in l:
			if i % 2 == 0:
				a = True
	if a:
		print('Yes')
	else:
		print('No')


import sys
input = sys.stdin.readline
output = sys.stdout.write

def main():
	tests = int(input().rstrip())
	for i in range(tests):
		length_ = int(input().rstrip())
		list_ = list(map(int, input().rstrip().split()))
		if length_ % 2 == 0:
			i = 0
			for num in list_:
				if num % 2 == 1:
					i += 1
			if not (0 < i < length_) is True:
				output('NO')
			else:
				output('YES')
		else:
			state = False
			for num in list_:
				if num % 2 == 1:
					state = True
					break
			if state:
				output('YES')
			else:
				output('NO')
		output('\n')
main()


test = int(input())
for _ in range(test):
	n = int(input())
	l = list(map(int, input().split()))
	o = []
	e = []
	if sum(l) % 2:
		print('YES')
	else:
		for i in l:
			if i % 2:
				o.append(i)
			else:
				e.append(i)
		if o and e:
			print('YES')
		else:
			print('NO')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	if sum(arr) % 2 != 0:
		print('YES')
		continue
	odd = 0
	for i in arr:
		if i % 2 != 0:
			odd += 1
	if odd == 0:
		print('NO')
		continue
	if odd % 2 == 0:
		if n - odd > 0:
			print('YES')
		else:
			print('NO')
	else:
		print('YES')


t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	tsum = sum(arr)
	(e, o) = (0, 0)
	if tsum % 2 != 0:
		print('YES')
	else:
		for i in arr:
			if i % 2 == 0:
				e += 1
			else:
				o += 1
		if e >= 1 and o >= 1:
			print('YES')
		else:
			print('NO')


for _ in range(int(input())):
	n = int(input())
	li = list(map(int, input().split()))
	c = 0
	s = sum(li)
	if s % 2 == 1:
		print('YES')
	else:
		f = 0
		e = 0
		for ele in li:
			if ele % 2 == 1:
				f = 1
			else:
				e = 1
		if f == 1 and e == 1:
			print('YES')
		else:
			print('NO')


t = int(input())
for i in range(t):
	n = int(input().strip())
	a = list(map(int, input().split()))
	l = len(a)
	o = 0
	e = 0
	for i in a:
		if i % 2 == 0:
			e += 1
		else:
			o += 1
	if l % 2 == 0 and (e == l or o == l):
		print('NO')
	elif l % 2 == 1 and e == l:
		print('NO')
	else:
		print('YES')


t = int(input())
for _ in range(t):
	n = int(input())
	arr = [int(i) for i in input().split()]
	odd = 0
	even = 0
	s = sum(arr)
	for i in range(len(arr)):
		if arr[i] % 2 == 0:
			even = even + 1
		else:
			odd = odd + 1
	if s % 2 != 0:
		print('YES')
	elif even != 0 and odd != 0:
		print('YES')
	else:
		print('NO')


def fun(ls, n):
	count_even = 0
	count_odd = 0
	for i in ls:
		if i % 2 == 0:
			count_even += 1
		else:
			count_odd += 1
	if n == count_even:
		print('NO')
		return
	if n == count_odd:
		if n % 2 != 0:
			print('YES')
			return
		else:
			print('NO')
	else:
		print('YES')
T = int(input())
for i in range(T):
	val = int(input())
	ls = list(map(int, input().split()))
	fun(ls, val)


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	p = 0
	if n % 2:
		for i in a:
			if i % 2:
				print('YES')
				p += 1
				break
	else:
		k = 0
		for i in a:
			if not i % 2:
				k += 1
		if k > 0 and k != n:
			print('YES')
			p += 1
	if p == 0:
		print('NO')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	od = 0
	for i in a:
		if i & 1:
			od += 1
	sm = sum(a)
	ev = n - od
	if sm & 1:
		print('YES')
	elif od and ev:
		print('YES')
	else:
		print('NO')