#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
const pair<int, int> X = make_pair(-INF, 0);
int f[270500];
int find(int u) { return f[u] == u ? u : f[u] = find(f[u]); }
bool merge(int u, int v) {
  u = find(u);
  v = find(v);
  if (u == v) return 0;
  f[u] = v;
  return 1;
}
struct Data {
  pair<int, int> x, y;
  void upd(const pair<int, int> &B) {
    if (B.first > x.first) {
      if (B.second != x.second) y = x;
      x = B;
    } else if (B.second != x.second)
      y = max(y, B);
  }
  void upd(const Data &B) {
    upd(B.x);
    upd(B.y);
  }
} o[270500];
pair<int, int> to[270500];
int n, a[270500];
long long ans;
int main() {
  scanf("%d", &n);
  int lim = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    while (lim <= a[i]) lim <<= 1;
  }
  a[++n] = 0;
  for (int u = 1; u <= n; u++) f[u] = u;
  for (int cntl = 0; cntl < n - 1;) {
    for (int s = 0; s < lim; s++) o[s] = (Data){X, X};
    for (int u = 1; u <= n; u++) {
      to[u] = X;
      find(u);
      o[a[u]].upd(make_pair(a[u], f[u]));
    }
    for (int l = 1; l < lim; l <<= 1)
      for (int p = 0; p < lim; p += l + l)
        for (int k = 0; k < l; k++) o[p | k | l].upd(o[p | k]);
    for (int u = 1; u <= n; u++) {
      int ts = (lim - 1) ^ a[u];
      pair<int, int> sav = (o[ts].x.second == f[u]) ? o[ts].y : o[ts].x;
      sav.first += a[u];
      to[f[u]] = max(to[f[u]], sav);
    }
    for (int u = 1; u <= n; u++)
      if (f[u] == u && to[u].first >= 0 && merge(u, to[u].second)) {
        ans += to[u].first;
        cntl++;
      }
  }
  long long sum = 0;
  for (int u = 1; u <= n; u++) sum += a[u];
  printf("%lld", ans - sum);
  return 0;
}
