def umami_check(_been_umami, _been_ls):
    if _been_umami < _been_ls[0]:
        return False
    elif _been_umami == _been_ls[0]:
        now_umami = 0
    else:
        now_umami = _been_ls[0]
    for i in range(1, n):
        #print("kansuu",i)
        if _been_umami < (now_umami + _been_ls[i]):
            return False
        elif _been_umami == (now_umami + _been_ls[i]):
            now_umami = 0
        else:
            now_umami+=_been_ls[i]
    if (now_umami == 0) or (now_umami == _been_umami):
        return True
    else:
        return False

n = int(input())
been_ls = list(map(int, input().split()))
been_sum = sum(been_ls)
for i in range(n,0,-1):
    been_umami = been_sum/i
    #print("i",i,"been_umami",been_umami,"been_sum",been_sum)
    if (been_umami % 1) == 0:
        bo = umami_check(int(been_umami),been_ls)
        #print(bo)
        if bo == True:
            print(i)
            break