from collections import defaultdict, deque, Counter
from heapq import heapify, heappop, heappush
import math
from copy import deepcopy
from itertools import combinations, permutations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right

import sys

def input():
    return sys.stdin.readline().rstrip()
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getListGraph():
    return list(map(lambda x:int(x) - 1, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]

mod = 10 ** 9 + 7
MOD = 998244353
sys.setrecursionlimit(10000000)
inf = float('inf')
eps = 10 ** (-15)
dy = [0, 1, 0, -1]
dx = [1, 0, -1, 0]

#############
# Main Code #
#############

# 3個ずつ取る

T = getN()
for _ in range(T):
    N = getN()
    A = getList()
    q = []
    for a in A:
        heappush(q, -a)

    while len(q) >= 3:
        o1, o2, o3 = -heappop(q), -heappop(q), -heappop(q)
        sub = min(o1, o2, o3)
        o1 -= sub
        o2 -= sub
        o3 -= sub
        if o1:
            heappush(q, -o1)
        if o2:
            heappush(q, -o2)
        if o3:
            heappush(q, -o3)

    if len(q) == 0:
        print('Yes')
    else:
        print('No')