#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <sstream>
#include <vector>
#define PI acos(-1.0)
const int  inf =  (1<<30) - 10;
using namespace std;
inline int get_int()
{
    int r=0;
    char c;
    while((c=getchar())!=' '&&c!='\n')
        r=r*10+c-'0';
    return r;
}
inline void out(int x)
{
    if(x>10)
    {
        out(x/10);
    }
    putchar(x % 10 + '0');
    putchar('\n');
}
/****************************************/

int main()
{
    long long t,n,m,k,l;
    scanf("%I64d",&t);
    while(t--){
        scanf("%I64d",&n);
        m=0;l=0;
        for(long long i=0;i<n;i++){
            scanf("%I64d",&k);
            if(k==1)
                m=1;
            if(k==0)
                l=1;
        }
        if(m&&l)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}