1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
template <class T>
using Ve = vector<T>;
#define ALL(v) (v).begin(), (v).end()
#define pii pair<ll, ll>
#define rep(i, a, b) for(ll i = (a); i <= (b); ++i)
#define per(i, a, b) for(ll i = (a); i >= (b); --i)
#define pb push_back
bool Mbe;
ll read() {
    ll x = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
    return x * f;
}
void write(ll x) {
    if(x < 0) putchar('-'), x = -x;
    if(x > 9) write(x / 10);
    putchar(x % 10 + '0');
}
const ll N = 2e5 + 9;
ll n, a[N], b[N], d[N];
bool Med;
int main() {
    cerr << fabs(&Med - &Mbe) / 1048576.0 << "MB\n";
    n = read();
    rep(i, 1, n) a[i] = read();
    ll s = accumulate(a + 1, a + n + 1, 0ll);
    per(L, n, 1) {
        if(s % L) continue;
        rep(i, 0, n + 1) b[i] = a[i], d[i] = 0;
        bool flag = 1;
        rep(i, 1, n) {
            d[i] += d[i - 1], b[i] += d[i];
            if(b[i] < 0) {
                flag = 0;
                break;
            }
            if(b[i]) {
                if(i + L - 1 > n) {
                    flag = 0;
                    break;
                }
                d[i] -= b[i], d[i + L] += b[i];
            }
        }
        if(flag) {
            write(L), putchar('\n');
            return 0;
        }
    }
    cerr << "\n" << clock() * 1.0 / CLOCKS_PER_SEC * 1000 << "ms\n";
    return 0;
}