def solution(numbers, target):
current = index = 0
def dfs(numbers, target, current, index):
if index == len(numbers):
return 1 if current == target else 0
return dfs(numbers, target, current + numbers[index], index + 1) + dfs(numbers, target, current - numbers[index], index + 1)
answer = dfs(numbers, target, index, current)
return answer