def divisors(n):
    ans = []
    i = 1
    while i * i <= n:
        if n % i == 0:
            ans.append(i)
            if i != n//i:
                ans.append(n//i)
        i += 1

    ans.sort()
    return ans

n = int(input())
a = list(map(int, input().split()))
b = sum(a)

for d in divisors(b):
    cnt = 0
    for i in a:
        cnt += i
        if cnt > d:
            break
        elif cnt == d:
            cnt = 0
    else:
        break

print(b // d)