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


using namespace std;


int solve(int n, vector <int> &a) {
    long long sum = 0;
    for (int &ai : a) {
        sum += ai;
    }

    vector <int> diff(n + 1);
    for (int i = 0; i <= n; i++) {
        diff[i] = (i < n ? a[i] : 0) - (i > 0 ? a[i - 1] : 0);
    }

    for (int k = n; k >= 2; k--) if (sum % k == 0) {
        bool ok = true;
        for (int r = 0; r < k; r++) {
            long long curr = 0;
            for (int i = r; i <= n; i += k) {
                curr += diff[i];
                if (curr < 0) {
                    ok = false;
                    break;
                }
            }

            if (curr != 0) {
                ok = false;
            }

            if (!ok) {
                break;
            }
        }

        if (ok) {
            return k;
        }
    }

    return 1;
}

int main() {
    ios_base::sync_with_stdio(false);

    int n;
    cin >> n;

    vector <int> a(n);
    for (int &ai : a) {
        cin >> ai;
    }

    cout << solve(n, a);

    return 0;
}