递归 | HJ93 数组分组

# 最优解
def dfs(three, five, other):
    if not other:
        if sum(three) == sum(five):
            return True
        else:
            return False
    if dfs(three+other[:1], five, other[1:]):
        return True
    if dfs(three, five+other[:1], other[1:]):
        return True
 
while True:
    try:
        n, nums = int(input()), list(map(int, input().split()))
        three, five, other = [], [], []
        for num in nums:
            if num % 3 == 0:
                three.append(num)
            elif num % 5 == 0:
                five.append(num)
            else:
                other.append(num)
        if dfs(three, five, other):
            print ('true')
        else:
            print ('false')
    except:
        break