#include<bits/stdc++.h>
using namespace std;
#define MAX_N 1009
int ds[MAX_N];
int main(){
int t, n, p, flg;
scanf("%d", &t);
while(t--){
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", ds+i);
sort(ds+1, ds+1+n, greater<int>());
p = 1, flg = 1;
while(ds[p] > 0 && flg == 1){
for(int i = 1; i <= ds[p]; i++){
if(p+i > n || ds[p+i] < 1) {
flg = 0;
break;
}
ds[p+i]--;
}
p++;
sort(ds+p, ds+1+n, greater<int>());
}
if(flg) printf("yes\n");
else printf("no\n");
}
return 0;
}