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
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define first f
#define second s

const int N=1e5+10;
vector<int> koniec(N, 0);
int arr[N];

int czy_mozna(int n, int l){
    int cur = 0;
    for(int i = n; i >= 1; i--){
        cur += koniec[i];
        if( cur > arr[i] ){
            for(int j = max(0, i-l); j <= n; j++) koniec[j] = 0;
            return 0;
        }
        if( cur == arr[i] ) continue;
        if( i-l+1 < 1 ){   
            for(int j = max(0, i-l); j <= n; j++) koniec[j] = 0;
            return 0;
        }
        koniec[ i - l ] = -(arr[i]-cur);
        cur = arr[i];
    }
    for(int j = 1; j <= n; j++) koniec[j] = 0;
    return 1;
}

void solve(){
    int n; ll s = 0LL;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> arr[i];
        s += (ll)arr[i];
    }
    for(int i = n; i >= 2; i--){
        if( s%(ll)i !=0 ) continue;
        if( czy_mozna(n, i) ){
            cout << i << "\n";
            return;
        }
    }
    cout << "1\n";
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    solve();
}