Problem: Kuroni isn't good at economics. So he decided to found a new financial pyramid called Antihype. It has the following rules:

  1. You can join the pyramid for free and get 0 coins. 
  2. If you are already a member of Antihype, you can invite your friend who is currently not a member of Antihype, and get a number of coins equal to your age (for each friend you invite). 



n people have heard about Antihype recently, the i-th person's age is a_i. Some of them are friends, but friendship is a weird thing now: the i-th person is a friend of the j-th person if and only if a_i  AND  a_j = 0, where AND denotes the [bitwise AND operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND).

Nobody among the n people is a member of Antihype at the moment. They want to cooperate to join and invite each other to Antihype in a way that maximizes their combined gainings. Could you help them? 

Input

The first line contains a single integer n (1≤ n ≤ 2⋅ 10^5) — the number of people.

The second line contains n integers a_1, a_2, ..., a_n (0≤ a_i ≤ 2⋅ 10^5) — the ages of the people.

Output

Output exactly one integer — the maximum possible combined gainings of all n people.

Example

Input


3
1 2 3


Output


2

Note

Only the first and second persons are friends. The second can join Antihype and invite the first one, getting 2 for it.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  register long long x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 3) + (x << 1) + ch - '0';
    ch = getchar();
  }
  return (f == 1) ? x : -x;
}
inline void file() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
int n, a[(1 << 18) + 1], F[(1 << 18) + 1], cnt[(1 << 18) + 1],
    sz[(1 << 18) + 1];
int find(int u) {
  if (F[u] != u) F[u] = find(F[u]);
  return F[u];
}
long long _;
signed main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read(), cnt[a[i]]++, _ -= a[i];
  for (int i = 0; i < (1 << 18); i++) F[i] = i, sz[i] = 1;
  cnt[0]++;
  for (int i = (1 << 18) - 1; ~i; i--) {
    for (int j = i;; j = (j - 1) & i) {
      if (cnt[j] && cnt[i ^ j]) {
        int xx = find(j), yy = find(i ^ j);
        if (xx != yy) {
          if (sz[xx] > sz[yy]) swap(xx, yy);
          F[xx] = yy;
          sz[yy] += sz[xx];
          _ += (long long)i * (cnt[j] + cnt[i ^ j] - 1);
          cnt[j] = cnt[i ^ j] = 1;
        }
      }
      if (!j) break;
    }
  }
  cout << _;
  return 0;
}