#include<bits/stdc++.h>
#define ll long long
#define rep(i,s,t) for(int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(int i=(s);i>=(t);i--)
using namespace std;
ll ci(){
	ll x; scanf("%lld",&x); return x;
}

enum{N=200023};

pair<int,int> a[N];
pair<int,int> b[N];
bool fail = 0;

void solve(int l,int r){
		//printf("line %d: %d %d\n", __LINE__, l,r);
	if( l>r ) return ;
	if( a[l].first==a[r].first ){
		if( r-l+1 >= 3 ) fail = 1;
		return ;
	}
	int tot = l-1;
	int totr = r+1;
	rep(i,l,r) if( a[i].first&1 ){
		a[i].first--;
		a[i].first/=2;
		b[++tot] = a[i];
	}else{
		a[i].first/=2;
		b[--totr] = a[i];
	}
	rep(i,l,r) a[i] = b[i];
	solve(l,tot);
	solve(totr,r);
}

int c[N];

signed main(){
	int T = ci();
	while( T-- ){
		int n = ci();
		rep(i,1,n) a[i] = {c[i] = ci(), i};
		sort(a+1, a+n+1);
		fail = 0;
		solve(1,n);
		if( fail ){
			puts("NO");
		}else{
			puts("YES");
			rep(i,1,n) printf("%d ", c[a[i].second]); puts("");
		}
	}
	return 0;
}