#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int,int> pi;
typedef vector <ll> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MOD 1000000007
#define maxn 5010
//~ #define getchar_unlocked _getchar_nolock
int N,D[maxn],ss[maxn];
inline int readInt() {
int x = 0;
char ch = getchar_unlocked();
while (ch < '0' || ch > '9') ch = getchar_unlocked();
while (ch >= '0' && ch <= '9'){
x = (x << 3) + (x << 1) + ch - '0';
ch = getchar_unlocked();
}
return x;
}
vpi A[maxn];
int dp[maxn][maxn];
int updates[maxn];
int32_t main() {
fast;
N = readInt();
FOR(i,1,N){
D[i] = readInt();
ss[i] = ss[i-1] + D[i];
}
FOR(l,2,N) FOR(r,l+1,N-1) if ((ss[l-1] + ss[r]) % 2 == 0){
int ssb = (ss[l-1] + ss[r]) / 2;
int b = lower_bound(ss+l,ss+r,ssb) - ss;
if (ss[b] == ssb ){
//~ cout << l-1 << ' ' << b << ' ' << r << '\n';
A[b].pb(pi(l-1,r));
}
}
FOR(i,0,N) reverse(all(A[i]));
DEC(i,N,1){
FOR(k,0,A[i].size()-1){
int newdp = dp[max(i,A[i][k].s+1)][i] + k + 1;
if (A[i][k].f - 1 >= 0) updates[A[i][k].f-1] = max(updates[A[i][k].f-1], newdp);
}
int mx = 0;
DEC(j,i-1,0){
mx = max(mx, updates[j]);
updates[j] = -1;
dp[i][j] = max(dp[i+1][j], mx);
}
}
cout << dp[1][0];
}
