#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;i--)
#define FOR(i,s,n) for(int i = s;i < (int)n;i++)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;i--)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a = b;return true;}return false;}
constexpr long long INF = 1e18;



signed main(){
	int N;
	cin>>N;
	vector<int>a(N);
	REP(i,N)cin>>a[i];
	int sum = accumulate(ALL(a),0);
	vector<int>s(N+1,0);
	REP(i,N)s[i+1]=s[i]+a[i];
	int ans = -1;
	for(int j = 1;j * j <= sum;j++){
		if(sum%j)continue;
		int now = 0;
		int flg = 1;
		while(1){
			int next = lower_bound(ALL(s),s[now]+j)-s.begin();
			if(next==N+1)flg=0;
			if(s[next]-s[now]!=j)flg=0;
			if(flg==0)break;
			if(next==N)break;
			now=next;
		}
		if(flg)CHMAX(ans,sum/j);
		now = 0;
		flg = 1;
		int nj = sum / j;
		while(1){
			int next = lower_bound(ALL(s),s[now]+nj)-s.begin();
			if(next==N+1)flg=0;
			if(s[next]-s[now]!=nj)flg=0;
			if(flg==0)break;
			if(next==N)break;
			now=next;
		}
		if(flg)CHMAX(ans,sum/nj);
	}
	cout<<ans<<endl;
}