#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
    int N; cin >> N;
    vector<int> A(N), B(N);
    for (int i = 0; i < N; ++i) cin >> A[i];
    for (int i = 0; i < N; ++i) cin >> B[i];
    int l = 0, r = 0;
    ll as = 0;
    int bl = 0, br = 0;
    int b01[] = {1, 0};
    ll ans = 0;
    while (l < N) {
        while (r < N) {
            if ((as + A[r]) != (as ^ A[r])) break;
            as += A[r];
            br ^= B[r]; ++b01[br];
            ++r;
        }
        ans += b01[bl] - 1;

        as -= A[l];
        --b01[bl]; bl ^= B[l];
        ++l;
    }
    cout << ans << endl;
}