#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int ans=0;
vector<int> vect;
void dfs(int l, int r){
if (l>=r)return;
if (l+1==r){
ans+=!!(vect[l]^vect[r]);
return;
}
int a=vect[l], b=vect[r];
while (a!=b){
if (a>b){
if (l<r-1){
--r;
b+=vect[r];
++ans;
}
else{
++ans;
return;
}
}
else{
if (l<r-1){
++l;
a+=vect[l];
++ans;
}
else{
++ans;
return;
}
}
}
dfs(l+1, r-1);
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
vect.resize(n);
for (int i=0; i<n; ++i)cin>>vect[i];
dfs(0, n-1);
cout<<ans;
}
