// ===== template.hpp =====
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

[[maybe_unused]] constexpr i32 inf = 1000000100;
[[maybe_unused]] constexpr i64 inf64 = 3000000000000000100;

struct SetIO {
    SetIO() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(10);
    }
} set_io;
// ===== template.hpp =====

#ifdef DEBUGF
#include  "../new_library/other/debug.hpp"
#else
#define DBG(x) (void) 0
#endif

int main() {
    i32 n;
    cin >> n;
    Vec<i64> a(n), b(n);
    REP(i, n) {
        cin >> a[i];
    }
    REP(i, n) {
        cin >> b[i];
    }
    
    Vec<i64> asum(n + 1, 0);
    REP(i, n) {
        asum[i + 1] = asum[i] + a[i];
    }
    Vec<i64> axor(n + 1, 0);
    REP(i, n) {
        axor[i + 1] = axor[i] ^ a[i];
    }
    Vec<i64> bxor(n + 1, 0);
    REP(i, n) {
        bxor[i + 1] = bxor[i] ^ b[i];
    }
    Vec<i64> bxorsum(n + 2, 0);
    REP(i, n + 1) {
        bxorsum[i + 1] = bxorsum[i] + bxor[i];
    }
    
    auto range_b_count = [&](i64 x, i32 l, i32 r) -> i64 {
        if (x == 1) {
            return bxorsum[r] - bxorsum[l];
        } else {
            return r - l - (bxorsum[r] - bxorsum[l]);
        }
    };
    
    i64 ans = 0;
    REP(i, n) {
        // max r s.t. sum([l, r)) - xor([l, r)) = 0
        i32 ok = i, ng = n + 1;
        while (ng - ok > 1) {
            i32 mid = (ok + ng) / 2;
            if (asum[mid] - asum[i] == (axor[mid] ^ axor[i])) {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        i32 max_r0 = ok;
        // max r s.t. sum([l, r)) - xor([l, r)) = 1
        ng = n + 1;
        while (ng - ok > 1) {
            i32 mid = (ok + ng) / 2;
            if (asum[mid] - asum[i] == (axor[mid] ^ axor[i]) + 1) {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        i32 max_r1 = ok;
        DBG(max_r0);
        DBG(max_r1);
        ans += range_b_count(bxor[i], i + 1, max_r0 + 1);
        ans += range_b_count(!bxor[i], max_r0 + 1, max_r1 + 1);
    }
    cout << ans << '\n';
}