#include <bits/stdc++.h>
using namespace std;
using ll = long long;

bool solve(){
    ll N; cin >> N;
    vector<ll> A(N);
    for(ll i = 0; i < N; i++) cin >> A[i];
    sort(A.begin(),A.end());
    
    ll zero_cnt = 0;
    vector<ll> B, C;
    for(ll i = 0; i < N; i++){
        if(A[i] < 0) C.push_back(A[i]);
        if(A[i] == 0) zero_cnt++;
        if(A[i] > 0) B.push_back(A[i]);
    }
    sort(B.rbegin(),B.rend()); sort(C.begin(),C.end());

    if(zero_cnt == 0) return true;
    if(zero_cnt >= 2) return false;
    if(N % 2 == 0) return false;
    if(B.size() % 2 == 0) return true;
    if(B.back() != -C.back()) return true;
    if((B.back() != B[B.size() / 2]) || (C.back() != C[C.size() / 2])) return true;
    for(ll i = 0; i < N; i++) if(A[i] % B.back() != 0) return true;

    for(auto &x : A) x /= B.back();
    for(auto &x : C) x /= B.back();
    for(auto &x : B) x /= B.back();
    if(-4 >= C[0] || B[0] >= 4) return true;
    map<ll,ll> cnt;
    for(auto x : A) cnt[x]++;
    if(cnt[3] >= 1  && cnt[2] % 2 == 0)  return true;
    if(cnt[-3] >= 1 && cnt[-2] % 2 == 0) return true;
    if(cnt[3] >= 2  && cnt[2] % 2 == 1)  return true;
    if(cnt[-3] >= 2 && cnt[-2] % 2 == 1) return true;
    return false;
}

int main(){
    ll T; cin >> T;
    while(T--) cout << (solve() ? "Yes" : "No") << "\n";
}