#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n), b(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	vector<vector<int>> bita(n, vector<int>(30));
	rep(i, n) {
		int copya = a[i];
		rrep(j, 30) {
			bita[i][j] = copya % 2;
			copya /= 2;
		}
	}
	int r = 0;
	long long ans = 0;
	vector<int>nowbit(30);
	int b0 = 0, b1 = 0;
	rep(i, n) {
		while (r < n) {
			bool chk = true;
			rep(j, 30) {
				if (0 == bita[r][j])continue;
				if (nowbit[j])chk = false;
			}
			if (!chk)break;
			if (1 == b1 % 2) {
				if (b[r])b0++;
				else b1++;
			}
			else {
				if (b[r])b1++;
				else b0++;
			}
			rep(j, 30)nowbit[j] += bita[r][j];
			r++;
		}
		ans += b0;
		//cout << i << " " << r << endl;
		rep(j, 30)nowbit[j] -= bita[i][j];
		if (1 == b[i])swap(b0, b1);
		b0--;
	}
	cout << ans << endl;
	return 0;
}