# https://sky-time-math.hatenablog.jp/entry/2020/09/08/153230
def intsqrt(n):
    dig=0
    while pow(10,2*dig) < n:
        dig+=1
    
    sq=0
    for k in reversed(range(0,dig+1)):
        for l in range(0,10):
            sq+=10**k
            if sq*sq==n:
                break
            if sq*sq>n:
                sq-=10**k
                break
    return sq

t = int(input())

for _ in range(t):
    n = int(input())
    a = list(map(int, input().split()))

    p = 1
    for v in a:
        p *= v
        
    rt = intsqrt(p)
    print("Yes" if rt * rt == p else "No")