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
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define st first
#define nd second
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>

const int maxn = 1e5+7;

int tab[maxn];
int konce[maxn];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int n;
    cin>>n;

    ll suma = 0;
    for(int i=1;i<=n;i++){
        cin>>tab[i];
        suma += tab[i];
    }

    int ile,wyn = 1;
    bool czyok;
    for(int i=1;i<=n;i++){
        if(suma%i != 0)
            continue;

        ile = 0;
        czyok = 1;
        for(int j=1;j<=n;j++){
            if(ile > tab[j])
                czyok = 0;
            else if(ile < tab[j]){
                if(j+i-1 > n)
                    czyok = 0;
                else
                    konce[j+i-1] = tab[j]-ile;
                ile = tab[j];
            }
            ile -= konce[j];
            konce[j] = 0;
        }

        if(czyok)
            wyn = i;
    }

    cout<<wyn<<"\n";
    
    return 0;
}