#include<bits/stdc++.h>
#define LL long long
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=5005;
int T,n;unordered_map<int,int>c;
struct node{int x,y;}a[N];
inline void sol(int l,int r)
{
	if(l==r) return;
	sort(a+l,a+1+r,[](node x,node y){return (x.x&1)<(y.x&1);});
	if((a[l].x&1)==(a[r].x&1)) return;
	for(int w=l;w<=r;w++) if((a[w].x^a[w+1].x)&1)
	{
		for(int i=l;i<=r;i++) a[i].x>>=1;
		return sol(l,w),sol(w+1,r);
	}
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>T;
	while(T--)
	{
		cin>>n;bool ok=1;c.clear();
		for(int i=1;i<=n;i++) cin>>a[i].x,a[i].y=a[i].x,c[a[i].x]++;
		for(auto [x,y]:c) if(y>2){ok=0;break;}
		if(!ok){cout<<"NO\n";continue;}sol(1,n);cout<<"YES\n";
		for(int i=1;i<=n;i++) cout<<a[i].y<<" ";cout<<"\n";
	}
	return 0;
}