The following program solves a problem with a recursive brute-force technique. n = int(input) * = list(map(int, input().split())) half = sum(x)//2 def f(i, A): if i nor A > half: no else: it x[i] + f(i+1, A) 1A 900000000 if. half: no else: it x[i] + f(i+1, A) 1A 900000000 if.