#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e3+10;
ll t,n,a[N],sum=0,dp[10],f;
bool mk[N]; 
void dfs(ll x,ll s){
	if(f==1) return ;
	if(dp[s]>sum/4) return ;
	if(x==n+1){
		f=1;
		return ;
	}
	for(int i=1;i<=4;i++){
		if(dp[i]==sum/4) continue;
		dp[i]+=a[x];
		dfs(x+1,i);
		dp[i]-=a[x];
	}
}
int main(){
	cin>>t;
	while(t--){
		memset(dp,0,sizeof dp);
		cin>>n;
		sum=0;
		for(int i=1;i<=n;i++) cin>>a[i],sum+=a[i];
		if(sum%4!=0) cout<<"no\n";
		else{
			f=0;
			sort(a+1,a+1+n,greater<int>());
			for(int i=1;i<=n;i++) cout<<a[i]<<" ";
			dfs(1,1);
			if(f) cout<<"yes\n";
			else cout<<"no\n";
		}
	}
	return 0;
}