#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<map>

#include<vector>

using namespace std;

typedef long long ll;

inline ll read()

{

    ll x=,f=; char ch=getchar();

    while(ch<''||ch>'') { if(ch=='-') f=-; ch=getchar(); }

    while(ch>=''&&ch<='') { x=(x<<)+(x<<)+(ch^); ch=getchar(); }

    return x*f;

}

const int N=;

const ll INF=1e18;

ll n,a[N],b[N];

ll Ans;

vector <int> V;

map <ll,int> cnt;

bool vis[N];

int main()

{

    n=read(); if(n==) { printf("0\n"); return ; }

    for(int i=;i<=n;i++) a[i]=read(),cnt[a[i]]++;

    for(int i=;i<=n;i++) b[i]=read();

    for(int i=;i<=n;i++) if(cnt[a[i]]>) V.push_back(i),vis[i]=;

    for(int i=;i<=n;i++)

    {

        if(vis[i]) continue;

        for(auto A: V) if(a[A]>a[i]&&((a[A]&a[i])==a[i])) { V.push_back(i),vis[i]=; break; }

    }

    for(auto A: V) Ans+=b[A];

    printf("%lld\n",Ans);

    return ;

}