#include <map>
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
int n;
int o[300111];
map<ll, ll> mp;
int main(void) {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &o[i]);
	}
	for (int i = 1; i <= n; i += 2) {
		o[i] *= -1;
	}

	ll s = 0;
	for (int i = 0; i <= n; i++) {
		s += o[i];
		mp[s]++;
	}

	ll ans = 0;
	for (auto [k, v] : mp) {
		ans += v * (v - 1) / 2;
	}

	printf("%lld\n", ans);
}
#include <bits/stdc++.h>
//#include <atcoder/modint>
//using namespace atcoder;
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
const ll INF = (1LL<<61);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N;
    vec a(N);
    ll sum{}, res{};
    unordered_map<ll, ll> num;
    num[0] = 1;
    rep(i, N){
        cin>>a[i];
        sum += (i&1 ? a[i] : -a[i]);
        res += num[sum];
        num[sum] += 1;
    }
    cout<<res<<endl;
}