#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>

using namespace std;

typedef long long LL;
const int N = 1e5 + 7;
int n, m;
int a[N];

int check()
{
    int x = 0, y = 0;
    for(int i = 0; i < n; i ++)
        if(a[i] == 0)
        x = 1;
    else if(a[i] == 1)
        y = 1;
    return x && y;
}

int work(int T = 0)
{
    scanf("%d", &n);
    for(int i = 0; i < n; i ++)
        scanf("%d", &a[i]);
    puts(check() ? "YES" : "NO");
    //puts("NO");
    return 0;
}

int main()
{
    int T = 0;
    scanf("%d", &T);
    for(int i = 1; i <= T; i ++)
        work(i);
    return 0;
}