#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int T,n,p,a[N];
bool check()
{
	if(a[1] != 1 || a[2] != 1) return false;
	for(int i = 3;i <= n;i++) if(a[i] != 2) return false;
	return true;
}
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		for(int i = 1;i <= n;i++) scanf("%d",&a[i]);
		sort(a + 1,a + n + 1);
		if(check())
		{
			puts("No");
			continue;
		}
		for(p = n + 1;a[p - 1] > 1;p--);
		if(p >= n - 1 || p == n - 2 && a[p] == a[n - 1] && a[p] == a[n]) puts("NO");
		else puts("Yes");
	}
	return 0;
}