#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
typedef  long long int lint;
typedef pair<int, int> P;
typedef pair<lint, lint> LLP;
typedef pair<char, char>CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
vector<char>NUM(10);
	NUM = { '0','1','2' ,'3' ,'4' ,'5' ,'6' ,'7' ,'8' ,'9' };
*/



int main() {
	int N;
	cin >> N;
	vector<int>A(N);
	rep(i, N) {
		cin >> A[i];
	}
	vector<int>SA(N);
	SA[0] = A[0];
	for (int i = 1; i < N; i++) {
		SA[i] = SA[i-1]+A[i];
	}
	int ssum = 0;
	int sum = 0;
	int ans = 0;
	int c = 0;
	rep(i, N) {
		ssum = SA[i];
		sum = 0;
		ans = 0;
		c = 0;
		for (int j = i + 1; j < N; j++) {
			if (sum + A[j] <= ssum) {
				sum += A[j];
				if (sum == ssum) {
					sum = 0;
					ans++;
				}
			}
			else {
				c = 1;
				break;
			}
	}
		if (c == 0) {
			cout << ans+1 << endl;
			return 0;
		}
	}
}