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
//fast
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

#define rep(n) for(ll i = 0 ; i<n ; i++)
#define all(x) x.begin(),x.end()
#define pb push_back

vector<ll> f(ll n){
    vector<ll> d;
    for (ll i = 1 ; i*i<=n ; i++){
        if (n%i==0){
            d.pb(n/i);
            if (i*i!=n) d.pb(i);
        }
    }
    return d;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin >> n;
    ll a[n];
    ll od[2*n+1];
    ll b[n];
    ll sum = 0;
    rep(n){
        cin >> a[i];
        sum+=a[i];
    }
    vector<ll> dziel = f(sum);
    sort(all(dziel));
    reverse(all(dziel));
    ll pom = 0;
    for (ll k : dziel){
        if (k>n) continue;
        pom = 0;
        rep(n){
            b[i] = a[i];
            od[i] = 0;
        }
        od[n] = 0;
        bool ok = 1;
        rep(n){
            pom+=od[i];
            b[i]-=pom;
            if (b[i]<0){
                ok = 0;
                break;
            }
            od[i+k]-=b[i];
            pom+=b[i];
        }
        pom+=od[n];
        if (ok && pom==0){
            cout << k << '\n';
            return 0;
        }
    }
}