// #define _GLIBCXX_DEBUG #include 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 inline T Absolute( const T& a ){ return a > 0 ? a : - a; } int main() { CIN( ll , T ); REPEAT( T ){ CIN( ll , N ); list coprime{}; FOR( i , 0 , N ){ CIN( ll , Ai ); auto itr = coprime.begin() , end = coprime.end(); while( itr != end ){ ll& coprime_j = *itr; ll coprime_j_c = coprime_j; ll Ai_c = Ai; while( coprime_j_c > 0 && Ai_c > 0 ){ if( coprime_j_c < Ai_c ){ Ai_c -= coprime_j_c * ( Ai_c / coprime_j_c ); } else { coprime_j_c -= Ai_c * ( coprime_j_c / Ai_c ); } } ll gcd = coprime_j_c + Ai_c; coprime_j /= gcd; Ai /= gcd; if( coprime_j == 1 ){ itr = coprime.erase( itr ); } else { itr++; } } if( Ai != 1 ){ coprime.push_back( Ai ); } } bool square = true; FOR_ITR( coprime , itr , end ){ ll& Ai = *itr; ll sqrt = 0; ll power = 1; while( power * power < Ai ){ power *= 2; } while( power != 0 ){ ll sqrt_new = sqrt + power; ll sqrt_new_sq = sqrt_new * sqrt_new; while( sqrt_new_sq > Ai ){ power /= 2; sqrt_new = sqrt + power; sqrt_new_sq = sqrt_new * sqrt_new; } if( sqrt_new_sq == Ai ){ break; } else { sqrt = sqrt_new; power /= 2; } } if( power == 0 ){ square = false; break; } } cout << ( square ? "Yes" : "No" ) << endl; } return 0; }