def floor_sqrt(n):
  if n<0:
    return -1
  ng,ok=n+1,-1
  while ng-ok>1:
    mid=(ok+ng)//2
    if mid*mid<=n:
      ok=mid
    else:
      ng=mid
  return ok

def solve():
  n=int(input())
  a=list(map(int,input().split()))
  tmp=1
  for i in a:
    tmp*=i
  s=floor_sqrt(tmp)
  if s*s==tmp:
    print('Yes')
  else:
    print('No')

for _ in range(int(input())):
  solve()