#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

vector<long long> divisor(long long n){
    vector<long long> res;
    for(long long i = 1; i*i <= n; i++){
        if(n%i==0){
            res.push_back(i);
            if(n/i != i)res.push_back(n/i);
        }
    }
    return res;
}

int main(){
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i,n) cin >> a[i];
  int sum = accumulate(a.begin(), a.end(), 0);
  auto div = divisor(sum);
  ll res = 0;
  for (auto d : div) {
    bool ok = true;
    for (int l = 0,  r = 0; l < n; l = r) {
      int s = 0;
      while (s < d && r < n) {
        s += a[r];
        r++;
      }
      if (s != d) ok = false;
    }
    if (ok) res = max(res, sum / d);
  }
  cout << res << endl;
  return 0;
}