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
#include <cstdlib>
#include <bitset>
#include <functional>
#include <utility>
#include <chrono>
#include <tuple>
#include <new>
#include <memory>
#include <climits>
#include <cfloat>
#include <cinttypes>
#include <exception>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <forward_list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <valarray>
#include <ios>
#include <istream>
#include <ostream>
#include <iostream>
#include <fstream>
#include <streambuf>
#include <cstdio>
#include <thread>
// #include <bits/stdc++.h>
using namespace std;

int n;
long long t[100005], suma = 0;
long long do_odjecia[200005];

bool przetestuj(int k)
{
    long long ile_mam = 0;
    long long roznica = 0;
    for (int i = 1; i <= n; i++)
    {
        ile_mam -= do_odjecia[i];
        roznica = t[i] - ile_mam;
        if (roznica < 0 || (roznica > 0 && i > n - k + 1))
            return 0;
        ile_mam += roznica;
        do_odjecia[i + k] = roznica;
    }
    return 1;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);

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

    for (long long x = n; x >= 1; x--)
    {
        if (suma % x != 0)
            continue;
        if (!przetestuj((int)x))
            continue;
        cout << x;
        return 0;
    }
}