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
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
#include <algorithm>
#include<bits/stdc++.h>
 
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define ff first
#define ss second
#define turbo ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mid ((l+r)/2)
#define midLL ((l+r)/2LL)
#define mide ((lo+hi)/2)
#define mideLL ((lo+hi)/2LL)
//#define endl '\n'
#define lowbit(x) x&(-x)
#define bits(x) __builtin_popcount(x) 
#define mins(se) (*se.begin())
#define maxs(se) (*--se.end())
#define all(x) x.begin(), x.end()
#define log2_floor(i) (i ? __builtin_clzll(1) - __builtin_clzll(i) : -1)
#define siz(cont) ((int)cont.size())
#define each(it, cont) for(auto &it : cont)
#define ein(cont) for(auto &it : cont) cin >> it;
#define mp(a, b) make_pair(a, b)

using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using pli = std::pair<ll, int>;
using pil = std::pair<int, ll>;
using vll = std::vector<pll>;
using vii = std::vector<pii>;
using vi = std::vector<int>;
using vl = std::vector<ll>;
using vvl = std::vector<vl>;
using vvi = std::vector<vi>;
using vvii = std::vector<vii>;
using vli = std::vector<pli>;
using vvli = std::vector<vli>;
using vil = std::vector<pil>;
using vvil = std::vector<vil>;
using vc = std::vector<char>;
using vvc = std::vector<std::vector<char>>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;

#ifdef JDKURWE
void err() { std::cout << "\n"; fflush(stdout); }
template<class T, class... Ts>
void err(T arg, Ts &... args) {
    std::cout << arg << ' ';
    err(args...);
}
#else 
void err() {}
template<class T, class... Ts>
void err(T arg, Ts &... args) {
    err(args...);
}
#endif

using namespace std;

ll MX = 1e6+100;

vl v;
ll n, big_sum, big_ile;
ll res = 1;
vl add;

inline bool check(int k) {
    ll s = 0;
    fill(all(add), 0);
    for (int i = 0; i < siz(v); i++) {
        s += add[i];
        if (s > v[i])
            return false;
        if (v[i] > s) {
            if (i+k >= siz(add))
                return false;
            add[i+k] -= v[i]-s;
            s = v[i];
        }
    }
    return true;
}

vll turbina(ll x) {
    ll orig = x;
    vll rz;
    for (ll i = 2; i*i <= orig; i++) 
        if (x%i == 0) {
            rz.pb({i, 0});
            while (x%i == 0) {
                rz.back().ss++;
                x /= i;
            }
        }
    if (x != 1)
        rz.pb({x, 1});
    return rz;
}

vll roz;
vl dz;
void go(int i=0, ll k=1) {
    if (k > n)
        return;
    if (i == siz(roz)) {
        dz.pb(k);
        return;
    }
    for (int j = 0; j <= roz[i].ss; j++) {
        go (i+1, k);
        k *= roz[i].ff;
    }
}

ll get_ile_min() {
    ll last = 0, rs = 0;
    for (int i = 0; i < siz(v); i++) {
        if (v[i] > last)
            rs += v[i]-last;
        last = v[i];
    }
    return rs;
}


signed main() { 
    turbo;
    cin >> n;
    v = vl(n);
    add = vl(n+1);
    each(it, v) {
        cin >> it;
        big_sum += it;
    }
    roz = turbina(big_sum);
    go();
    sort(all(dz));
    ll mi = get_ile_min();
    for (int i = siz(dz)-1; i >= 0; i--)
        if (big_sum/dz[i] < mi) {
            dz[i] = 1;
        }
    vi ind(siz(dz));
    for (int i = 0; i < siz(ind); i++)
        ind[i] = i;

    srand(42);
    random_shuffle(all(ind));
    while (!ind.empty()) {
        while (!ind.empty() and dz[ind.back()] <= res)
            ind.ppb();
        if (ind.empty())
            break;
        ll it = dz[ind.back()];
        ind.ppb();
        if (check(it)) {
            res = it;
            continue;
        }

        for (auto &dzie : dz) {
            if (dzie%it == 0)
                dzie = 1;
        }
    }
    cout << res;
}