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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const int nax = 1e5 + 10;
int v[nax], rt[nax];
int n;

bool check(int k) {
  for(int i = 0; i <= n; i++) rt[i] = 0;
  int cur = 0;
  for(int i = 0; i < n; i++) {
    cur -= rt[i];
    if(cur > v[i]) return 0;
    if(i > n - k && v[i] != cur) return 0;
    rt[i + k] += v[i] - cur;
    cur = v[i];
  }
  return 1;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  
  cin >> n;
  ll s = 0;
  for(int i = 0; i < n; i++) {
    cin >> v[i];
    s += v[i];
  }
  ll ans = 1;
  for(int i = 2; i <= n; i++) {
    if(s % i == 0 && check(i)) ans = i;
  }
  cout << ans << endl;
}