#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <map>
#include <vector>
#include <cmath>
#include <set>

using namespace std;

#define rep(i, l, r) for(int i=l; i<=r; i++)
#define    dow(i, l, r) for(int i=l; i>=r; i--)
#define travel(x) for(edge *p=fir[x]; p; p=p->n)
#define travel_sap(x) for(edge *p=fir[x]; p; p=p->n)
#define clr(x,c) memset(x, c, sizeof(x))

typedef pair<int,int> Pii;
typedef long long ll;

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define lowbit(x) (x&-x)
#define l(x) Left[x]
#define r(x) Right[x]

#define maxn 100009

inline int read()
{
    int x=0, f=1; char ch=getchar();
    while (ch<'0' || ch>'9') {if (ch=='-') f=-1; ch=getchar();}
    while ('0'<=ch && ch<='9') x=x*10+ch-'0', ch=getchar();
    return x*f;
}

int main()
{
    int t=read(); while (t--)
    {
        int n=read(), A=0; while (n--)
        {
            int k=read();
            if (k==0) A|=1;
            if (k==1) A|=2;
        }
        if (A==3) puts("YES"); else puts("NO");
    }
    return 0;
}