import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong;
      }
      auto B = new int[N];
      foreach (i; 0 .. N) {
        B[i] = readInt;
      }
      
      auto ASum = new long[N + 1];
      auto AXor = new long[N + 1];
      auto BXor = new int[N + 1];
      foreach (i; 0 .. N) {
        ASum[i + 1] = ASum[i] + A[i];
        AXor[i + 1] = AXor[i] ^ A[i];
        BXor[i + 1] = BXor[i] ^ B[i];
      }
      
      auto cntB = new long[2][N + 2];
      foreach (i; 0 .. N + 1) {
        static foreach (b; 0 .. 2) {
          cntB[i + 1][b] = cntB[i][b] + ((BXor[i] == b) ? 1 : 0);
        }
      }
      
      bool check(int l, int r) {
        return (ASum[r] - ASum[l] == (AXor[r] ^ AXor[l]));
      }
      long ans;
      for (int i = 0, j; i < N; ++i) {
        for (; j + 1 <= N && check(i, j + 1); ++j) {}
        const b = BXor[i];
        ans += (cntB[j + 1][b] - cntB[i + 1][b]);
      }
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}