def divisor(N):
    ret = []
    c = int(N**0.5) + 1
    for i in range(1, c):
        if N % i == 0:
            ret.append(i)
            if N != i * i:
                ret.append(N//i)
    ret.sort()
    return ret

_ = int(input())
A = list(map(int, input().split()))
s = sum(A)
for d in divisor(s):
    n = 0
    for a in A:
        n += a
        if n > d:
            break
        elif n == d:
            n = 0
    else:
        break
print(s//d)