import java.io.*;  

import java.math.BigInteger;  

import java.util.*;  
public class Main  
{  
    public static void main(String args[])  
    {  
        Scanner cin = new Scanner(System.in);     

        int T=cin.nextInt();

        BigInteger a[] = new BigInteger[1005];

        while (T>0)

        {  
            T--;
            int n = cin.nextInt();  

            for (int i=1;i<=n;++i)
            {
                a[i]=cin.nextBigInteger();
            }
            if (n==1)
            {
                System.out.println("Yes");
                continue;
            }
            if (n==2)
            {
                if (a[1].compareTo(BigInteger.valueOf(0))==0)
                {
                    if (a[2].compareTo(BigInteger.valueOf(0))!=0)
                    {
                        System.out.println("No");
                        continue;
                    }
                }
                if (a[2].compareTo(BigInteger.valueOf(0))==0)
                {
                    if (a[1].compareTo(BigInteger.valueOf(0))!=0)
                    {
                        System.out.println("No");
                        continue;
                    }
                }
                System.out.println("Yes");
                continue;
            }
            boolean flag=true;
            for (int i=1;i<=n-2;++i)
            {
                BigInteger now=a[i].multiply(a[i+2]);
                BigInteger now2=a[i+1].multiply(a[i+1]);
                if  (now.compareTo(now2)!=0) flag=false;
            }
            int num=0;
            for (int i=1;i<=n;++i)
            {
                if (a[i].compareTo(BigInteger.valueOf(0))==0) num++;
            }
            if (num>0&&num<n) flag=false;
            if (flag) System.out.println("Yes");
            else  System.out.println("No");
        }  

    }  

}