#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,0,-1},dy={-1,0,1,0};
bool inside(int y,int x,int h,int w){
	if(y<h && y>=0 && x<w && x>=0) return true;
	return false;
}





int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;cin >> n;
	vector<int> a(n);
	int sum = 0;
	rep(i,n){
		cin >> a.at(i);
		sum += a.at(i);
	}
	int ans = 0;
	for(int i = 1; i <= sum; i++){
		if(sum % i == 0){
			int sum1 = 0, ans1 = 0;
			bool ok = true;
			rep(j,n){
				sum1 += a.at(j);
				if(sum1 == i){
					ans1++;
					sum1 = 0;
				}
				if(sum1 > i){
					ok = false;
					break;
				}
			}
			if(sum1 > 0){
				if(sum1 == i) ans1++;
				else ok = false;
			}
			if(ok) ans = max(ans, ans1);
		}
	}
	cout << ans << endl;
}