#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 9973;
const double eps = 1e-8;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int max(int x, int y) {
  if (x > y) return x;
  return y;
}
long long powmod(long long a, long long b) {
  unsigned long long ans = 1, pow = a % mod;
  while (b) {
    if (b & 1) ans = (ans * pow) % mod;
    pow = (pow * pow) % mod;
    b >>= 1;
  }
  return ans % mod;
}
bool is_prime(int x) {
  if (x < 2) return false;
  int len = sqrt(x);
  for (int i = 2; i <= len; i++) {
    if (x % i == 0) return false;
  }
  return true;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int sum = 0;
    int n;
    cin >> n;
    int mm = 0, nn = 0;
    int x;
    for (int i = 0; i < n; i++) {
      cin >> x;
      if (x % 2 == 0)
        mm = 1;
      else
        nn = 1;
      sum += x;
    }
    if (sum % 2 != 0 || (mm && nn))
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
