#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
  x = 0;
  int f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -f;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  x *= f;
}
void print(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (!x) return;
  print(x / 10), putchar(x % 10 + 48);
}
void write(int x) {
  if (!x)
    putchar('0');
  else
    print(x);
  putchar('\n');
}
const int maxn = 1e6 + 10;
const int inf = 1e9;
const double eps = 1e-8;
const int mod = 1e9 + 7;
long long ans;
int cnt[maxn], n, fa[maxn];
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
void unite(int x, int y) {
  if (!cnt[x] || !cnt[y]) return;
  int t = x + y;
  x = find(x), y = find(y);
  if (x == y) return;
  ans += 1ll * t * (cnt[x] + cnt[y] - 1);
  fa[x] = y, cnt[x] = cnt[y] = 1;
}
int main() {
  read(n);
  cnt[0] = 1;
  for (int i = 1, x; i <= n; i++) read(x), ans -= x, cnt[x]++;
  for (int i = 1; i < 1 << 18; i++) fa[i] = i;
  for (int i = (1 << 18) - 1; i; i--)
    for (int j = i; j; j = (j - 1) & i) unite(j, j ^ i);
  printf("%I64d\n", ans);
  return 0;
}
