#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <complex>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <random>

using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T> T iabs(const T& x) { return max(x, -x); }

int n;
vector<int> a;

int f(int x) {
    int c = 0;
    auto it = begin(a);
    while (it != end(a) - 1) {
        auto it_next = lower_bound(it, end(a), (c + 1) * x);
        if (it_next == end(a) || *it_next != (c + 1) * x) {
            return -1;
        }
        it = it_next;
        c++;
    }
    return c;
}

int main() {
    cin >> n;
    a.resize(n);
    int sum = 0;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        sum += a[i];
        if (i > 0) a[i] += a[i - 1];
    }
    int ans = 1;
    for (int x = 1; x * x <= sum; ++x) {
        if (sum % x == 0) {
            ans = max(ans, f(x));
            ans = max(ans, f(sum / x));
        }
    }
    cout << ans << endl;
    return 0;
}