#include <bits/stdc++.h>
using namespace std;
long long exp(long long a, long long n) {
  if (n == 0) return 1;
  long long residue = 1, result = a;
  while (n > 1LL) {
    if (n % 2LL == 1LL) residue = residue * residue % 1000000007LL;
    result = result * result % 1000000007LL;
    n = n >> 1;
  }
  return residue * result % 1000000007LL;
}
void sieve(long long n, vector<bool> &isPrime) {
  for (int i = 0; i <= n; i++) isPrime[i] = true;
  isPrime[0] = isPrime[1] = false;
  for (long long i = 2; i * i <= n; i++) {
    if (!isPrime[i]) continue;
    for (long long j = i * i; j <= n; j += i) {
      isPrime[j] = false;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t, n, sum, x, even, odd;
  cin >> t;
  while (t--) {
    cin >> n;
    sum = 0;
    odd = even = 0;
    for (int i = 0; i < n; i++) {
      cin >> x;
      sum += x;
      if (x % 2 == 0)
        even++;
      else
        odd++;
    }
    if (sum % 2 == 1)
      cout << "YES" << endl;
    else if (even > 0 && odd > 0)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
