#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long num = 0, w = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) {
    num = (num << 3) + (num << 1) + (ch ^ 48);
    ch = getchar();
  }
  return w ? -num : num;
}
inline void write(int x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
const long long mod = 1e9 + 7;
struct mat {
  long long a[15][15];
  mat() { memset(a, 0, sizeof(a)); }
};
mat mul(mat x, mat y) {
  mat res;
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < 2; j++)
      for (int k = 0; k < 2; k++)
        res.a[i][j] = (res.a[i][j] + x.a[i][k] * y.a[k][j]) % mod;
  return res;
}
long long qpow(int p) {
  mat bas;
  mat res;
  for (int i = 0; i < 2; i++) res.a[i][i] = 1;
  bas.a[0][0] = bas.a[0][1] = bas.a[1][0] = 1;
  bas.a[1][1] = 0;
  while (p) {
    if (1 & p) res = mul(res, bas);
    bas = mul(bas, bas);
    p >>= 1;
  }
  return res.a[0][1];
}
int main() {
  int t;
  t = read();
  while (t--) {
    int n;
    n = read();
    int sum = 0;
    int num = 0;
    for (int i = 0; i < n; i++) {
      int k;
      cin >> k;
      if (k % 2 == 1) sum++;
      if (k % 2 == 0) num++;
    }
    if (n % 2 == 1) {
      if (sum)
        cout << "Yes" << endl;
      else
        cout << "NO" << endl;
    } else {
      if (sum != 0 && num != 0)
        cout << "yes" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
