#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}
template<class T> T pow(T x, ll y){if (y == 0) return 1;T p = pow(x,y/2);if (y%2 == 0) return p*p;else return p*p*x;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector<int> A(n), B(n+1);
    rep(i,n) cin >> A[i];
    rep(i,n) cin >> B[i+1];
    vector<vector<int>> S(n+1,vector<int>(31));
    rep(i,n){
        rep(j,31) S[i+1][j] = S[i][j];
        int a = A[i];
        int j = 0;
        while (a > 0){
            if (a&1) S[i+1][j]++;
            a>>=1;
            j++;
        }
        B[i+1] ^= B[i];
    }
    int ans = 0;
    rep2(r,1,n+1){
        int l = max(r-30,0);
        while (l != r){
            if (B[l] != B[r]){
                l++;
                continue;
            }
            bool flag = true;
            rep(i,31){
                if (S[r][i]-S[l][i] > 1){
                    flag = false;
                    break;
                }
            }
            if (flag) ans++;
            l++;
        }
    }
    cout << ans << endl;
}