def f(a):
    count = 0
    for i in range(n):
        if a[i] >= sum(a[i+1:]):
            count += 1
        if n-count < 3:
            return (-1)
        elif len(a[i+1:]) == 3:
            return (count)
    return(count)