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

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<pair<int, int>, int> PP;
const ll INF = 1LL << 60;
const int MAX = 1000000000;
const ll MOD = 1000000007;

int GCD(int a, int b) { return b ? GCD(b, a%b) : a; }
//------------------------------------------------------------------------------------------------------------------------------

int main(void) {
    int N;
    cin >> N;
    vector<int> a(N);
    int sum = 0;
    for (int i = 0; i < N; i++) {
        cin >> a[i];
        sum += a[i];
    }
    vector<int> d;
    for (int i = 1; i * i <= sum; i++) {
        if (sum % i == 0) {
            d.push_back(i);d.push_back(sum/i);
        }
    }
    sort(d.begin(),d.end());
    for(auto x : d){
        int s = 0;
        bool f = true;
        for (int i = 0; i < N; i++) {
            if (s > x){
                f = false; break;
            }
            else if(s==x){
                s = a[i];
            }
            else{
                s += a[i];
            }
        }
        if (f && s == x) { 
            cout << sum / x << endl;
            return 0;
        }
    }
}