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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <tuple>
#include <bitset>
#include <cmath>

using namespace std;

#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define x first
#define y second

typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

const int MAXN = 1e6 + 2;

ll A[MAXN];

bool check(ll x, ll n){
    ll c = 0;    
    vi W(n+1, 0);
    for(ll i=0; i<n; i++){
        c += W[i];
        if(c>A[i]){
            return false;
        }

        ll d = A[i]-c;
        if(d > 0){
            if(i+x > n){
                return false;
            }
            c += d;
            W[i+x] -= d;
        }
    }
    return true;
}


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll n;
    cin >> n;

    ll s=0;
    for(ll i=0; i<n; i++){
        ll a;
        cin >> a;
        A[i] = a;
        s += a;
    }

    vll D;
    ll r = (ll)sqrt(s) + 1;
    for(ll i=1; i<r; i++) { 
        if(s%i==0){
            if(i<=n){
                D.pb(i);
            }
            if(s/i<=n){
                D.pb(s/i);
            }
        }
    }

    sort(D.begin(), D.end(), greater<>());

    for(auto d: D){
        if(check(d, n)){
            cout << d << "\n";
            break;
        }
    }

    return 0;
}