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
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define RFOR(i,p,n) for(int i=(p);i>=(n);--i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define pn printf("\n")
using namespace std;
typedef long long ll;
typedef __int128_t lll;
typedef V<int> vi;
typedef V<ll> vll;
typedef const int ci;
typedef const ll cll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf = 2.1e9;
cll infll = 4.5e18;
int I(){
    int z;
    scanf("%d", &z);
    return z;
}
ll LL(){
    ll z;
    scanf("%lld", &z);
    return z;
}

void answer(){
    ci n = I();
    vll a(n);
    REP(i, n) a[i] = I();
    vll b(n+1);
    FOR(i, 0, n) b[i] = (i<n ? a[i] : 0) - (i ? a[i-1] : 0);

    ll suma = 0;
    for(ll x : a) suma += x;
    RFOR(k, n, 1) if(suma%k == 0){
        bool git = true;
        REP(resz, k){
            ll pref = 0;
            for(int i = resz; i <= n; i += k){
                pref += b[i];
                git &= pref>=0;
            }
            git &= pref==0;
        }
        if(git){
            printf("%d\n", k);
            return;
        }
    }
}

int main(){
    int tt = 1;
    while(tt--) answer();
}