#include <bits/stdc++.h>
using namespace std;

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

  int N;
  cin >> N;

  vector<int> A(N);
  for (int i = 0; i < N; ++i) cin >> A[i];

  vector<int> pa(N + 1);
  for (int i = 0; i < N; ++i) pa[i + 1] = pa[i] + A[i];

  int best = 1;
  for (int d = 1; d * d <= pa[N]; ++d) {
    if (pa[N] % d) continue;
    for (int k : { d, pa[N] / d }) {
      bool ng = false;
      for (int i = 0; i < N; ) {
        int j = i;
        int s = 0;
        while (s < k && j < N) s += A[j++];
        if (s != k) {
          ng = true;
          break;
        }
        i = j;
      }
      if (!ng) best = max(best, pa[N] / k);
    }
  }

  cout << best << endl;

  return 0;
}