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;
template <class T>
inline void rd(T &x) {
  x = 0;
  T f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') f = ch == '-' ? -1 : 1, ch = getchar();
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
  x *= f;
}
const int N = 1 << 18;
int n, a, cnt[N];
long long ans;
struct DSU {
  int fa[N], sz[N];
  inline void init() {
    for (int i = 0, I = (N - 1) + 1; i < I; ++i) fa[i] = i, sz[i] = 1;
  }
  int get(int x) {
    if (x == fa[x]) return x;
    return fa[x] = get(fa[x]);
  }
  inline int merge(int x, int y) {
    x = get(x), y = get(y);
    if (x == y) return 0;
    if (sz[x] < sz[y]) swap(x, y);
    int res = (sz[x] == 1 ? cnt[x] : 1) + (sz[y] == 1 ? cnt[y] : 1) - 1;
    fa[y] = x, sz[x] += sz[y];
    return res;
  }
} dsu;
int main() {
  rd(n);
  for (int i = 1, I = (n) + 1; i < I; ++i) rd(a), ++cnt[a], ans -= a;
  dsu.init();
  ++cnt[0];
  for (int sum = N - 1, I = (0) - 1; sum > I; --sum)
    for (int u = sum; u; u = (--u) & sum) {
      int v = sum - u;
      if (!cnt[u] || !cnt[v]) continue;
      ans += 1LL * sum * dsu.merge(u, v);
    }
  printf("%lld\n", ans);
}