//水题，排序后就能直接按照要求判断了，没什么坑点
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 105;
int a[N];
int main()
{
int T, n;
scanf("%d", &T);
while (T--)
{
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", a + i);
if (n < 10 || n > 13)
{
printf("No\n"); continue;
}
sort(a, a + n);
if (a[0] != 1 || a[1] != 1)
{
printf("No\n"); continue;
}
int flag = 1;
for (int i = 2; i < n - 1; i++)
if (a[i] - a[i - 1] > 2)
{
flag = 0; break;
}
if (flag) printf("Yes\n");
else printf("No\n");
}
return 0;
}
