#include <iostream>
#include<queue>
#include <algorithm>
#include <map>
#include<unordered_map>
#include <set>
#include <fstream>
#include <vector>
#include <math.h>
#include <iomanip>
#include <string>
#include <cstring>
using namespace std;
#define ll long long
ll mod = 1e9+7;
const int MaxN = 1000;
int MOD = 998244353;
int bit[200000];
int a[500+5][505];
ll ans=0;
int main() {
// freopen(".INP", "r", stdin);
//freopen(".OUT", "w", stdout);
int n;
cin >> n;
vector<ll> v(n+1);
vector<ll> pref(n+1);
pref[0]=0;
map<ll,ll> cnt;
for(int i=1;i<=n;i++){
cin >> v[i];
pref[i]= pref[i-1]+ v[i];
}
for(int i=1;i<=n;i++){
cnt[(pref[i-1]%2+2)%2]++;
ans+= cnt[(pref[i]%2+2)%2];
}
cout << ans;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxxdWV1ZT4KI2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPG1hcD4KI2luY2x1ZGU8dW5vcmRlcmVkX21hcD4KI2luY2x1ZGUgPHNldD4KI2luY2x1ZGUgPGZzdHJlYW0+CiNpbmNsdWRlIDx2ZWN0b3I+CiNpbmNsdWRlIDxtYXRoLmg+CiNpbmNsdWRlIDxpb21hbmlwPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8Y3N0cmluZz4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCiNkZWZpbmUgbGwgbG9uZyBsb25nCgpsbCBtb2QgPSAxZTkrNzsKY29uc3QgaW50IE1heE4gPSAxMDAwOwppbnQgTU9EID0gOTk4MjQ0MzUzOwppbnQgYml0WzIwMDAwMF07CgppbnQgYVs1MDArNV1bNTA1XTsKbGwgYW5zPTA7CmludCBtYWluKCkgewoJLy8gZnJlb3BlbigiLklOUCIsICJyIiwgc3RkaW4pOwoJLy9mcmVvcGVuKCIuT1VUIiwgInciLCBzdGRvdXQpOwoJaW50IG47CiAgICBjaW4gPj4gbjsKICAgIHZlY3RvcjxsbD4gdihuKzEpOwogICAgdmVjdG9yPGxsPiBwcmVmKG4rMSk7CiAgICBwcmVmWzBdPTA7CiAgICBtYXA8bGwsbGw+IGNudDsKICAgIGZvcihpbnQgaT0xO2k8PW47aSsrKXsKICAgIAljaW4gPj4gdltpXTsKICAgIAlwcmVmW2ldPSBwcmVmW2ktMV0rIHZbaV07CiAgICAJCgl9Cglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJY250WyhwcmVmW2ktMV0lMisyKSUyXSsrOwoJCWFucys9IGNudFsocHJlZltpXSUyKzIpJTJdOwoJfQoJY291dCA8PCBhbnM7CglyZXR1cm4gMDsKfQ==