// #define _GLIBCXX_DEBUG 
#include<bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;

#define CIN( LL , A ) LL A; cin >> A 
#define GETLINE( A ) string A; getline( cin , A ) 
#define GETLINE_SEPARATE( A , SEPARATOR ) string A; getline( cin , A , SEPARATOR ) 
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ) 
#define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( ll VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) 
#define FOR_ITR( ARRAY , ITR , END ) for( auto ITR = ARRAY .begin() , END = ARRAY .end() ; ITR != END ; ITR ++ ) 
#define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) 
#define RETURN( ANSWER ) cout << ( ANSWER ) << endl; return 0 
#define DOUBLE( PRECISION , ANSWER ) cout << fixed << setprecision( PRECISION ) << ( ANSWER ) << endl; return 0 
#define MIN( A , B ) A < B ? A : B;
#define MAX( A , B ) A < B ? B : A;

template <typename T> inline T Absolute( const T& a ){ return a > 0 ? a : - a; }

int main()
{
  CIN( ll , T );
  ll p[65536];
  p[0] = 2;
  ll size = 1;
  FOR( i , 3 , 65536 ){
    bool prime = true;
    FOR( j , 0 , size ){
      ll& pj = p[j];
      if( i % pj == 0 ){
	prime = false;
	break;
      } else if( pj * pj > i ){
	break;
      }
    }
    if( prime ){
      p[size] = i;
      size++;
    }
    i++;
  }
  REPEAT( T ){
    CIN( ll , N );
    ll count[65536] = {};
    FOR( i , 0 , N ){
      CIN( ll , Ai );
      FOR( j , 0 , size ){
	ll& pj = p[j];
	if( Ai % pj == 0 ){
	  ll& count_j = count[j];
	  while( Ai % pj == 0 ){
	    Ai /= pj;
	    count_j++;
	  }
	}
      }
    }
    bool square = true;
    FOR( j , 0 , size ){
      if( count[j] % 2 == 1 ){
	square = false;
	break;
      }
    }
    if( square ){
      cout << "Yes\n";
    } else {
      cout << "No\n";
    }
  }
  return 0;
}