import sys
import math

def get_divisors(n):
    divisors = set()
    for i in range(1, int(math.isqrt(n)) + 1):
        if n % i == 0:
            divisors.add(i)
            divisors.add(n // i)
    return sorted(divisors, reverse=True)

def main():
    n = int(sys.stdin.readline())
    a = list(map(int, sys.stdin.readline().split()))
    total = sum(a)
    
    if n == 0:
        print(0)
        return
    
    divisors = get_divisors(total)
    valid_rs = [d for d in divisors if d <= n]
    
    for r in valid_rs:
        s = total // r
        current_sum = 0
        count = 0
        valid = True
        for num in a:
            current_sum += num
            if current_sum == s:
                count += 1
                current_sum = 0
            elif current_sum > s:
                valid = False
                break
        if valid and current_sum == 0 and count == r:
            print(r)
            return
    
    print(1)

if __name__ == "__main__":
    main()