2454

##2454

using namespace std;
int t,n,a[1005];
bool cmp(int c,int b){
	return c>b;
}
int main(){
	cin>>t;
	while(t--){
		cin>>n;
		int sum=0,f=0;
		for(int i=0;i<n;i++){
			cin>>a[i];sum+=a[i];
			if(a[i]>=n) f=1;
		}
		if(sum%2||f){
			cout<<"no"<<endl;continue;
		}
		sort(a,a+n,cmp);
		for(int i=0;i<n;i++){
			for(int j=1;j<=a[i];j++){
				a[i+j]--;
				if(a[i+j]<0){
					cout<<"no"<<endl;
					f=1;break;
				} 
			}
			if(f)break;
			sort(a+i+1,a+n,cmp);
		}
		if(f==0&&a[n-1]==0){
			cout<<"yes"<<endl;
		}
	}
}