import java.io.*;
import java.math.*;
import java.util.*;

public class Main {
    
 
    
    public static void main(String[] args){
        Scanner input = new Scanner(System.in); 
        
        BigInteger yi=BigInteger.ONE,li=BigInteger.ZERO,fuyi=BigInteger.valueOf(-1);
        
        
        BigInteger cc[]= new BigInteger[110];
       
        int n,t;
        
        
        
        t=input.nextInt();
        
        for(int k=1;k<=t;k++)
        { 
            n=input.nextInt(); 

            int flag=1;
            int youli=0;
            int youyi=0;
            for(int i=1;i<=n;i++)
            {
                cc[i]=input.nextBigInteger();
                if(cc[i].compareTo(li)==0)
                    youli=1;;
                if(cc[i].compareTo(li)!=0)
                    youyi=1;
            }            
            if(youli==1&&youyi==1)
                flag=0;
            for(int i=2;i<=n-1;i++)
            {
                if(cc[i].multiply(cc[i]).compareTo(cc[i-1].multiply(cc[i+1]))!=0)
                    flag=0;
            }
            
            
            if(flag==1)
                System.out.println("Yes");
            else
                System.out.println("No");
            
        }
        
      
    }
}