import math
def solve():
    n = int(input())
    A = list(map(int,input().split()))
    for i in range(n):
        for j in range(i):
            g = math.gcd(A[i],A[j])
            A[i] //= g
            A[j] //= g

    
    for a in A:
        square = int(a**0.5)
        ok = 0
        for i in range(max(0,square-1),square+2):
            if i**2 == a:
                ok = 1
        if ok == 0:
            return "No"

    return "Yes"

t = int(input())
for _ in range(t):
    print(solve())