//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


int32_t main() {
    boost; IO();

    int N; 
    cin>>N; 
    vi x(N,0),y(N,0);
    FOR(i,0,N){
    	if(i%2==0) cin>>x[i];
    	else cin>>y[i];

    	if(i) x[i]+=x[i-1],y[i]+=y[i-1];
    }

    FOR(i,0,N) x[i]=x[i]-y[i];

    unordered_map<int,int>mp;
    mp[0]=1;
    int ans=0;
    FOR(i,0,N){
    	ans+=mp[x[i]];
    	mp[x[i]]++;
    }
    cout << ans << endl;

    return 0;
}
//Change your approach 
/*  Namo Buddhaya */

#include <bits/stdc++.h>

using namespace std;

#define nl "\n"
#define sp " "
#define PI 2 * acos(0)
#define mem(arr, value) memset(arr, value, sizeof(arr))
#define eps 1e-6
#define ll long long
//Predefined Function
ll gcd(ll a, ll b) { if (a % b == 0) return b; return gcd(b, a % b);}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }

//Function

//Main Function
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    //Start
    int i, j;
    int n;
    cin >> n;

    vector <int> dj(n);

    for(auto &x: dj)
    {
        cin >> x;
    }
    ll ans = 1LL << 32;
    for(i = 0; i < (1 << (n-1)); i++)
    {
        ll x = 0;
        ll o = 0;
        for(j = 0; j <= n; j++)
        {
            if(j < n) o = o | dj[j];
            if(j==n || (i >> j & 1))
            {
                x = x ^ o;
                o = 0;
            }
        }
        ans = min(ans,x);
    }

    cout << ans << nl;

    return 0; 
}
