#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

bool f(ll x, vector<ll>& a){
  ll n = a.size();
  ll s = 0;
  for(int i=0;i<n;i++){
    if(s+a[i]>x) return false;
    s += a[i];
    s %= x;
  }
  return true;
}
int main() {
  ll n;std::cin >> n;
  ll S = 0;
  vll a(n);get(a);
  re(i, n) S += a[i];
  ll ans = 1;
  for(ll i=1;i*i<=S;i++){
    if(S%i==0){
      if(f(i, a)) ans = max(ans, S/i);
      if(i*i!=S&&f(S/i, a)) ans = max(ans, i);
    }
  }
  std::cout << ans << '\n';
}