# Process input
n = int(input())
arr = list(map(int, input().split()))
# DFS
def dfs(arr, i, sumA, sumB):
if i == len(arr):
return sumA == sumB
num = arr[i]
if num % 5 == 0:
return dfs(arr, i+1, sumA+num, sumB)
elif num % 3 == 0:
return dfs(arr, i+1, sumA, sumB+num)
else:
if dfs(arr, i+1, sumA+num, sumB):
return True
return dfs(arr, i+1, sumA, sumB+num)
# Compute and output
res = dfs(arr, 0, 0, 0)
print("true" if res else "false")



京公网安备 11010502036488号