#include <bits/stdc++.h>
using namespace std;
using ll=long long;
bool solve(int n,vector<ll> a){
	vector<ll> b,c;
		for(int i=0;i<n;i++){
			if(a[i]<0)b.push_back(-a[i]);
			if(a[i]>0)c.push_back(a[i]);
		}
		int x=b.size(),y=c.size();
		if(n-x-y!=1){
			if(n-x-y==0)return true;
			else return false;
		}
	if(n%2==0)return false;
	if(x%2==0)return true;
	ranges::sort(b);
	ranges::sort(c);
	x/=2;y/=2;
	if(b[0]!=c[0])return true;
	int cnt1=0,cnt2=0;
	for(int t:b)if(t==b[0])cnt1++;
	for(int t:c)if(t==b[0])cnt2++;
	if(cnt1<x+1||cnt2<y+1)return true;
	cnt1=0;cnt2=0;
	for(int i=0;i<2*x+1;i++){
		if(b[i]!=b[0]&&b[i]!=b[0]*2&&b[i]!=b[0]*3)return true;
		if(b[i]==2*b[0]){
			cnt1++;
		}
		if(b[i]==3*b[0])cnt2++;
	}
	if(cnt1%2==0||cnt2>1)return true;
	cnt1=0;cnt2=0;
	swap(x,y);
	swap(b,c);
	for(int i=0;i<2*x+1;i++){
		if(b[i]!=b[0]&&b[i]!=b[0]*2&&b[i]!=b[0]*3)return true;
		if(b[i]==2*b[0]){
			cnt1++;
		}
		if(b[i]==3*b[0])cnt2++;
	}
	if(cnt1%2==0||cnt2>1)return true;
	return false;
}
	
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int ttt;
	cin>>ttt;
	while(ttt--){
		int n;
		cin>>n;
		vector<ll> a(n);
		for(int i=0;i<n;i++)cin>>a[i];
		if(solve(n,a))cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
}