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
73
#ifndef UNCLE
 #pragma GCC optimize("O3,unroll-loops")
#endif

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

#define FOR(i,p,q) for(int i=(p); i<=(q); ++i)
#define ROF(i,p,q) for(int i=(p); i>=(q); --i)
#define REP(i,q) for(int i=0; i<(q); ++i)
#define pb push_back
#define as assign
#define rz resize
#define Co const
#define al(X) X.begin(), X.end()
#define ral(X) X.rbegin(), X.rend()
#define sz(X) (int)((X).size())
#define ckmx(a,b) a=max(a,b)
#define ckmn(a,b) a=min(a,b)
#define V vector
typedef long long ll;
typedef long double ld;
typedef mt19937_64 mt;
#ifndef UNCLE
 typedef basic_string<bool> vb;
 typedef basic_string<int> vi;
 typedef basic_string<ll> vl;
#else
 typedef V<bool> vb;
 typedef V<int> vi;
 typedef V<ll> vl;
#endif

constexpr ll INFl=(ll)1e18+14;
constexpr int INFi=1e9+14, MX_N=1e5;

int N,M,Q;
void Inpt(){
    cin>>N;
    vi s(N,-1);
    ll sm=0;
    for(int &vv:s) cin>>vv,sm+=vv;
    vi isP(MX_N+1,1);
    isP[0]=isP[1]=0;
    vi pri;
    FOR(i,2,MX_N) if(isP[i]==1){
        pri.pb(i);
        for(int j=i+i;j<=MX_N;j+=i) isP[i]=i;
    }
    int rs=1;
    auto Chk=[&](Co int k) -> bool {
        vl alt(N+1,0);
        ll bl=0;
        REP(i,N){
            bl+=alt[i];
            if(s[i]<bl) return 0;
            if(s[i]>bl){
                if(i+k>N) return 0;
                alt[i+k]-=s[i]-bl,bl=s[i];
            }
        }
        return 1;
    };
    ROF(i,N,2) if(sm%i==0&&Chk(i)){ rs=i; break;}

    cout<<rs<<"\n";
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    Inpt();
}