#include <bits/stdc++.h>
using namespace std;
const long long md = 1e9 + 7;
const long long MX = 2e5 + 5;
const long long INF = 1e18;
const long double PI = 4 * atan((long double)1);
long long power_md(long long a, long long n) {
  long long res = 1;
  while (n) {
    if (n % 2) res = (res % md * a % md) % md;
    a = (a % md * a % md) % md;
    n /= 2;
  }
  res %= md;
  return res;
}
long long power(long long a, long long n) {
  long long res = 1;
  while (n) {
    if (n % 2) res *= a;
    a = a * a;
    n /= 2;
  }
  return res;
}
long long abst(long long a) { return ((a < 0) ? (-1 * a) : (a)); }
class cmp_set {
 public:
  bool operator()(long long a, long long b) { return a > b; }
};
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) long long idx,
               __attribute__((unused)) long long LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, long long idx, long long LINE_NUM, Head H,
               Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
bool cmp(pair<long long, long long> p1, pair<long long, long long> p2) {
  return (p1.first > p2.first);
}
int32_t main() {
  long long n;
  cin >> n;
  vector<pair<long long, long long> > v(n);
  for (long long i = 0; i < n; i++) cin >> v[i].first;
  for (long long i = 0; i < n; i++) cin >> v[i].second;
  sort(v.begin(), v.end(), cmp);
  vector<long long> vis(n, 0);
  for (long long i = 0; i < n; i++) {
    long long j = i;
    long long cnt = 0;
    while ((j < n) && (v[i].first == v[j].first)) {
      cnt++;
      j++;
      if (cnt == 2)
        vis[i] = vis[i + 1] = 1;
      else if (cnt > 2)
        vis[j - 1] = 1;
    }
    if (cnt == 1) continue;
    while (j < n) {
      if (((v[j].first ^ v[i].first) & v[j].first) == 0) {
        vis[j] = 1;
      }
      j++;
    }
  }
  long long res = 0;
  for (long long i = 0; i < n; i++) {
    if (vis[i]) res += v[i].second;
  }
  cout << res << "\n";
  return 0;
}
