Apple Division

import sys
from itertools import combinations, chain

dbg = 0


def powerset(iterable):
    "powerset([1,2,3]) --> () (1,) (2,) (3,) (1,2) (1,3) (2,3) (1,2,3)"
    s = list(iterable)
    return chain.from_iterable(combinations(s, r) for r in range(len(s) + 1))


# strict int
def sint(x):
    if isinstance(x, str):
        return int(x)
    if x.is_integer():
        return int(x)
    raise ValueError


def ep(*args, **kwargs):
    if dbg:
        print(*args, file=sys.stderr, **kwargs)


def p(**kwargs):
    ep(", ".join([f"{k} = {v}" for (k, v) in kwargs.items()]))


n = sint(input())
p_n = [sint(h) for h in input().split(" ")]
p(n=n, p_n=p_n)

if n == 1:
    ep("only one apple, difference is it's weight")
    print(p_n[0])
elif n == 0:
    ep("no apples, difference is 0")
    print(0)
else:
    ps = list(powerset(p_n))
    p(ps=ps)
    # in this case the powerset is ordered so that it's a complement palindrome, such that the first and last are
    # complement sets, and the second first and second last and so on. we should start from the middle
    # powerset is even size always
    max_diff = None
    for i in range(0, sint(len(ps) / 2)):
        diff = abs(sum(ps[i]) - sum(ps[-i - 1]))
        p(considering=(ps[i], ps[-i - 1]), diff=diff)
        if not max_diff or diff < max_diff:
            max_diff = diff
        if diff == 0:
            break
    print(max_diff)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: TIME LIMIT EXCEEDED