#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long ll;

#define sc1(a) scanf("%lld",&a)
#define sc2(a,b) scanf("%lld %lld",&a,&b)

#define pf1(a) printf("%lld\n", a)
#define pf2(a,b) printf("%lld %lld\n",a,b)

#define mx 10000007
#define mod 1000000007
#define PI acos(-1.0)

#define size1 200005

int drx[8] = {-2,-2,-1,-1,1,1,2,2};
int dcy[8] = {-1,1,-2,2,-2,2,-1,1};

int dirx[4] = { -1, 0, 1, 0 };
int diry[4] = { 0, -1, 0, 1 };


ll gcd(ll a,ll b){ if(b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}


int main()
{
    ll tc, num, t = 1, pownum;

    // freopen("/opt/Coding/clion code/input.txt", "r", stdin);
    // freopen("/opt/Coding/clion code/output.txt", "w", stdout);

    sc1(num);

    ll arr[num + 5], even[num + 5], odd[num + 5];

    memset(arr, 0, sizeof(arr));
    memset(even, 0, sizeof(even));
    memset(odd, 0, sizeof(odd));

    for(ll i = 1;  i <= num; i++){
         sc1(arr[i]);
         even[i] = even[i - 1];
         odd[i] = odd[i - 1];

         if(i & 1) odd[i] += arr[i];
         else even[i] += arr[i];
    }

    ll evenans = 0, oddans = 0, cnt = 0;

    for(ll i = 1; i <= num; i++){

        evenans = even[i - 1];
        oddans = odd[i - 1];

        evenans += odd[num] - odd[i];
        oddans += even[num] - even[i];

       // cout << evenans << " " << oddans << endl;

        if(evenans == oddans) cnt++;

    }

    pf1(cnt);

    return 0;
}