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
#include <bits/stdc++.h>
#pragma GCC target ("avx2,fma")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
const ll mod=1000000007;

#ifdef LOCAL
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

const int N=100007;

ll a[N],b[N];
ll P[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    ll S=0;
    FOR(i,1,n)
    {
		cin>>a[i];
		S+=a[i];
	}
	ROF(d,n,1)
	{
		if(S%d!=0) continue;
		FOR(i,1,n) b[i]=a[i],P[i]=0;
		bool ok=1;
		FOR(i,1,n)
		{
			P[i]+=P[i-1];
			debug(P[i]);
			b[i]-=P[i];
			if(b[i]<0) ok=0;
			if(i+d-1>n&&b[i]!=0) ok=0;
			P[i+1]+=b[i];
			P[i+d]-=b[i];
		}
		if(ok)
		{
			cout<<d<<endl;
			break;
		}
	}
    
    
    return 0;
}