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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define all(t) t.begin(), t.end()
#define pb push_back
#define fi first
#define se second
#define each(a,x) for(auto &a:x)
#define vi vector<int>
#define vll vector<ll>
#define vull vector<ull>
#define pi pair<int,int>
#define pll pair<ll,ll>
#define nl '\n'
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC target("bmi")
#pragma GCC target("bmi2")
#pragma GCC target("lzcnt")
#pragma GCC target("popcnt")
const int N = 2e5+1234,INF = 2e9+1234,mod = 1e9+7;
const ll INF_L = (ll)2e18+1234;
int n;
int A[N],S[N];
bool check(int k)
{
    if(k>n) return 0;
    rep(i,n) S[i]=0;
    rep(i,n)
    {
        int val=A[i]+S[i];
        if(val<0) return 0;
        if(val>0 and i+k-1>=n) return 0;
        S[i]-=val,S[i+k]+=val;
        S[i+1]+=S[i];
    }
    return 1;
}
void solve()
{
    cin>>n;rep(i,n)cin>>A[i];
    ll s=0;rep(i,n) s+=A[i];
    vector<int> kand;
    for(ll i=1;i*i<=s;++i)
    {
        if(s%i==0)
        {
            if(i<=n) kand.pb(i);
            if(i!=s/i and s/i<=n) kand.pb(s/i);
        }
    }
    sort(all(kand));
    for(int i=(int)kand.size()-1;i>=0;--i)
    {
        if(check(kand[i]))
        {
            cout << kand[i] << nl;return;
        }
    }
}
int main()
{ 
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T=1;
    //cin >> T;
    while(T--) solve();
    return 0;
}