#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int t, n, m, p, r, i, j, k, x, count1 = 0;
  cin >> t;
  while (t--) {
    cin >> n;
    long long int arr[n], odd = 0, even = 0, even1 = 0, odd1 = 0;
    map<int, int> m1;
    for (i = 0; i < n; i++) {
      cin >> arr[i];
      if (arr[i] % 2 == 0)
        even1++;
      else
        odd1++;
    }
    sort(arr, arr + n);
    k = 0;
    for (i = 0; i < n - 1; i++) {
      if (arr[i + 1] - arr[i] == 1) {
        k = 1;
        break;
      }
    }
    if ((even1 % 2 == 0 && odd1 % 2 == 0) ||
        (k == 1 && odd1 % 2 != 0 && even1 % 2 != 0))
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
