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;
using ll = long long;
class DSU {
 private:
  vector<int> comp, siz;

 public:
  DSU(int n) : comp(n), siz(n, 1) {
    for (int i = 0; i < n; ++i) comp[i] = i;
  }
  int getc(int i) {
    if (comp[i] != i) comp[i] = getc(comp[i]);
    return comp[i];
  }
  bool join(int a, int b) {
    a = getc(a);
    b = getc(b);
    if (a == b) return false;
    if (siz[a] < siz[b]) swap(a, b);
    siz[a] += siz[b];
    comp[b] = a;
    return true;
  }
  int compSize(int i) { return siz[getc(i)]; }
};
const int N = 1 << 18;
vector<int> ind[N];
int cou[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  ll res = 0;
  for (int i = 0; i < n; ++i) {
    int v;
    cin >> v;
    ++cou[v];
    res -= v;
  }
  ++cou[0];
  DSU dsu(N + 1);
  for (int m = N - 1; m >= 0; --m) {
    for (int x = m; x; x = (x - 1) & m) {
      int y = m ^ x;
      if (cou[x] == 0 || cou[y] == 0) continue;
      if (dsu.getc(x) == dsu.getc(y)) continue;
      res += (ll)(cou[x] + cou[y] - 1) * (x + y);
      dsu.join(x, y);
      cou[x] = 1;
      cou[y] = 1;
    }
  }
  cout << res << '\n';
}