CF1833C Vlad Building Beautiful Array

 

 

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
//#include<queue>
//#include<vector>
//#include<bits/stdc++.h>
#define ll long long
#define ddd printf("-----------------------\n");
using namespace std;
const int maxn=2e5+10 ;

ll n,a[maxn],minn,flag;

int main()
{
    ios::sync_with_stdio(false);
    int T;cin>>T;
    while(T--)
    {
        minn=0x3f3f3f3f,flag=1;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i],minn=min(minn,a[i]);
        if(minn%2==1){
            flag=1;    
        }
        else{
            for(int i=1;i<=n;i++){
                if(a[i]%2==1){
                    //cout<<"NO\n";
                    flag=0;
                    break;
                }
            }
        }
        if(flag) cout<<"YES\n";
        else cout<<"NO\n";
    }
    
    return 0;
}