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;
int n;
vector<int> freqs(1 << 18, 0);
vector<int> parents(1 << 18, -1);
int find(int u) {
  if (parents[u] == -1) {
    return u;
  } else {
    int ret = find(parents[u]);
    parents[u] = ret;
    return ret;
  }
}
void join(int u, int v) {
  u = find(u);
  v = find(v);
  if (u < v) swap(u, v);
  parents[v] = u;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    int val;
    cin >> val;
    freqs[val]++;
    if (freqs[val] == 1) {
      ans -= val;
    }
  }
  freqs[0]++;
  for (int u = 0; u < (1 << 18); u++) {
    if (freqs[u] < 2) continue;
    int mask = (1 << 18) - 1;
    mask &= ~u;
    for (int v = mask; v > 0; v = (v - 1) & mask) {
      if (!freqs[v]) continue;
      ans += v * (long long)(freqs[u] - 1);
      freqs[u] = 1;
      break;
    }
  }
  for (int sum = (1 << 18) - 1; sum >= 0; sum--) {
    for (int u = sum; u > 0; u = (u - 1) & sum) {
      int v = sum ^ u;
      if (u < v) break;
      if (!freqs[u] || !freqs[v]) continue;
      if (find(u) != find(v)) {
        ans += sum;
        join(u, v);
      }
    }
  }
  if (false)
    for (int i = 0; i < (1 << 18); i++) {
      if (freqs[i]) {
        if (parents[i] != -1) {
          ans -= i;
        }
      }
    }
  cout << ans << endl;
  return 0;
}