#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll N;
	cin>>N;
	vector<ll> A(N),B(N);
	rep(i,N) cin>>A[i];
	rep(i,N) cin>>B[i];
	vector<ll> sum_A(N+1),xor_A(N+1),xor_B(N+1);
	vector<vector<ll>> p(N+1,vector<ll>(2));
	p[0][0]=1;
	rep(i,N) sum_A[i+1]=sum_A[i]+A[i],xor_A[i+1]=(xor_A[i]^A[i]),xor_B[i+1]=(xor_B[i]^B[i]);
	rep(i,N){
		p[i+1]=p[i];
		p[i+1][xor_B[i+1]]++;
	}
	vector<int> l(2);
	ll ans=0;
	for(int r=1;r<=N;r++){
		rep(k,2) while(sum_A[r]-sum_A[l[k]]-k>(xor_A[r]^xor_A[l[k]])) l[k]++;
		int a=xor_B[r];
		ans+=p[r-1][a];
		if(l[0]) ans+=p[l[0]-1][a^1]-p[l[0]-1][a];
		if(l[1]) ans-=p[l[1]-1][a^1];
		//cout<<ans<<"\n";
		//cout<<l[0]<<" "<<l[1]<<" "<<r<<"\n";
	}
	cout<<ans<<"\n";
}