A-Array with odd sum

///////////////          PRANTA KUMER PANDIT            ///////////////
//                      Test Case Less Template                       ||
//                                                                    ||
//                                                                    ||
//      BANGLADESH  UNIVERSITY OF BUSINESS AND TECHNOLOGY             ||
//                          INTAKE 52                                 ||
//                      DEPARTMENT OF CSE                             ||
//                                                                    ||
//||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
//                      So, WELCOME TO ISHAN'S PERADISE           //
//                (-.-) Want to be a Secret tool of next ICPC  (-.-)    //
 
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define yes   cout<<"YES"<<endl
#define no   cout<<"NO"<<endl
#define all(x) (x).begin(), (x).end()
#define    gcd(a,b)      __gcd(a,b)
#define    lcm(a,b)  (a*b)/__gcd(a,b)
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
 
 
void ishan()
{
    int n;
    cin>>n;
 
vector<int> a(n);
//int sum=0;
    int even=0,odd=0;
 
 
    for(int i=0; i<n; i++)
    {
         cin>>a[i];
        // sum+=a[i];
        //int x;
       // cin >> x;
        if(a[i]%2==0) even++;
        else odd++;
    }
 
 
    if(even>0 && odd>0)
    {
        cout<<"YES"<<endl;
    }
    else if(odd>0 && odd%2==1) {cout<<"YES"<<endl;}
    else cout<<"NO"<<endl;
 
 
}
int main()
{
    optimize();
 
    int e ;
    cin>>e;
    while(e--)
    {
        ishan();
    }
 
}