def div(n):
    i = 1
    SS = set()
    while i * i <= n:
        if n % i == 0:
            SS.add(i)
            SS.add(n//i)
        i += 1
    return SS    


N = int(input())
A = list(map(int, input().split()))
Ac = [0] * (N + 1)
for i in range(N):
    Ac[i + 1] = Ac[i] + A[i]
S = set(Ac)
ans = 0
M = Ac[-1]
for d in div(M):
    now = d
    for v in range(M//d):
        if now not in S:
            break
    else:
        ans = max(ans, M//d)
print(ans)