#include <iostream>

using namespace std;
typedef long long ll;
ll a[100010],b[100010],od[100010],sum2[100010];
pair<ll,ll> sum[100010];
int main(){
    int i,n; cin >> n;
    for(i=0;i<n;i++) cin >> a[i];
    for(i=0;i<n;i++) cin >> b[i];
    sum[0] = {0,0}; od[0] = 0;
    for(i=1;i<=n;i++){
        sum[i] = sum[i - 1];
        sum[i].first += a[i - 1];
        sum[i].second ^= a[i - 1];
        od[i] = od[i - 1]^b[i - 1];
    }
    sum2[0] = 0;
    for(i=0;i<=n;i++) sum2[i + 1] = sum2[i] + od[i];
    ll ans = 0;
    for(i=1;i<=n;i++){
        int le = 0,ri = i - 1;
        if((sum[i].second^sum[le].second)==sum[i].first - sum[le].first){
            ri = 0;
        }else{
            while(ri - le>1){
                int mid = (le + ri)/2;
                if((sum[i].second^sum[mid].second)==sum[i].first - sum[mid].first) ri = mid;
                else le = mid; 
            }
        }
        if(od[i]) ans += sum2[i] - sum2[ri];
        else ans += (i - ri) - (sum2[i] - sum2[ri]);
    }
    cout << ans << endl;
}