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
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define JOIN_(X, Y) X##Y
#define JOIN(X, Y) JOIN_(X, Y)
#define TMP JOIN(tmp, __LINE__)
#define PB push_back
#define SZ(x) int((x).size())
#define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i)
#define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i)
#define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef unsigned int uint;

const int INF = 1e9 + 9;

struct Case {
  int n;
  vi a;
  vi divs;

  void solve() {
    cin >> n;
    a.resize(n);
    ll sum = 0;

    REP(i, n) {
      cin >> a[i];
      sum += a[i];
    }

    FORD(d, n, 1) {
      if (sum % d == 0) {
        DEB("new div=" << d << "\n");
        divs.PB(d);
      }
    }

    for (int div : divs) {
      if (verify(div)) {
        cout << div << "\n";
        return;
      }
    }
  }

  bool verify(int div) {
    DEB("verify div=" << div << "\n");
    vi in(n);
    int current = 0;
    REP(i, n) {
      int left = i - div;
      DEB("  i=" << i << " left=" << left << " in[left]="
                 << (left >= 0 ? to_string(in[left]) : "-") << "\n");
      if (left >= 0) {
        current -= in[left];
      }
      DEB("    current=" << current << " a[i]=" << a[i] << "\n");
      if (current > a[i]) {
        DEB("  EXCEED\n");
        return false;
      }
      if (current < a[i]) {
        int add = a[i] - current;
        DEB("  add=" << add << "\n");
        if (i + div > n) {
          DEB("  TOO FAR RIGHT\n");
          return false;
        }

        current += add;
        in[i] = add;
      }
    }
    return true;
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int z = 1;
  // cin >> z;
  while (z--) {
    Case().solve();
  }
}