#include <bits/stdc++.h>
using namespace std;

int N;
int A[100100];

bool F(int k)
{
    int l = 0, r = 1;
    while (r <= N)
    {
        if (A[r] - A[l] == k) {
            l = r; 
            r++;
        } else if (A[r] - A[l] < k) {
            r++;
        } else {
            return false;
        }
    }
    return true;
}

int main()
{
    cin >> N;
    for (int i=0; i<N; ++i) cin >> A[i+1];
    for (int i=0; i<N; ++i) A[i+1] += A[i];
    int sum = A[N];
    int ans = 1;
    for (int i=1; i*i<=sum; ++i)
    {
        if (F(sum/i)) ans = max(ans, i);
        if (F(i)) ans = max(ans, sum/i);
    }
    cout << ans << endl;
    return 0;
}