题解 | #数组分组#

# 只用考虑一个数组，是否能够达到和的一半
def dfs(left,mid,target):
    if sum(left) == target:
            return True
    if len(mid) == 0:
            return False
    else:
        for i in mid:
            if (sum(left) < target and i>0) or \
                (sum(left) > target and i<0):
                mid1 = mid.copy()
                l = False
                mid1.remove(i)
                l = dfs(left+[i],mid1,target)
                if l:
                    return True
        return False


def main(x):
    S = sum(x)
    if S%2 == 1:
        return False
    else:
        target = S//2
        left,right,mid = [0],[0],[]
        for i in x:
            if i%5 == 0:
                left.append(i)
            elif i%3 == 0:
                right.append(i)
            else:
                mid.append(i)
        if dfs(left,mid,target):
            return True
        else:
            return False

info = []
while True:
    try:
        n,x = int(input()),list(map(int,input().strip().split()))
        info.append(x)
    except:
        break
for x in info:
    if main(x):
        print('true')
    else:
        print('false')