def solve():
    n = int(input())
    neg = []
    pos = []
    zero = 0
    for x in map(int, input().split()):
        if x == 0:
            zero += 1
        elif x > 0:
            pos.append(x)
        else:
            neg.append(x)
    if zero >= 2:
        return False
    if zero == 0:
        return True
    if n % 2 == 0:
        return False
    if len(pos) % 2 == 0:
        return True
    mn = min(pos)
    for i in range(len(pos)):
        if pos[i] % mn:
            return True
        pos[i] //= mn
    for i in range(len(neg)):
        if neg[i] % mn:
            return True
        neg[i] //= mn
    d = sorted(set(pos + neg + [0]))
    return len(d) != d[-1] - d[0] + 1

for _ in range(int(input())):
    print('Yes' if solve() else 'No')