#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;
 
typedef long long ll;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=b-1LL;i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;
 
#define MOD 1000000007

int main(){
  ll n;
  cin>>n;
  ll sum = 0;
  vector<ll> v;
  rep(i,0,n){
     ll a;
     cin>>a;
     v.pb(a);
     sum += a;
  }
  set<ll> se;
  for(int i = 1; i*i <= sum; i++){
    if(sum%i==0){
      se.insert(i);
      se.insert(sum/i);
    }
  }
  vector<ll> v1(all(se));
  ll mx = 1;
  rep(i,0,v1.sz){
    ll d = v1[i];
    ll a = 0;
    rep(j,0,v.sz){
      a += v[j];
      if(a==d)a = 0;
    }
    if(a==0){
      mx = max(mx,sum/d);
    }
  }
  cout << mx << endl;
  return 0;
}