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;
namespace Fread {
const int MAXN = 1 << 20;
char buf[MAXN], *S, *T;
inline char getchar() {
  if (S == T) {
    T = (S = buf) + fread(buf, 1, MAXN, stdin);
    if (S == T) return EOF;
  }
  return *S++;
}
}  // namespace Fread
inline int read() {
  int f = 1, x = 0;
  char ch = Fread::getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = Fread::getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = Fread::getchar();
  }
  return x * f;
}
inline long long readll() {
  long long f = 1, x = 0;
  char ch = Fread::getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = Fread::getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = Fread::getchar();
  }
  return x * f;
}
const int MAXN = 2e5;
int n, a[MAXN + 5], cnt[MAXN + 5], fa[MAXN + 5], vis[MAXN + 5];
int get_fa(int x) { return x == fa[x] ? x : (fa[x] = get_fa(fa[x])); }
int main() {
  n = read();
  long long ans = 0;
  for (int i = 1; i <= n; ++i) a[i] = read(), cnt[a[i]]++, ans -= a[i];
  cnt[0]++;
  for (int i = 1; i <= MAXN; ++i) fa[i] = i;
  for (int i = (1 << 18) - 1; i >= 0; --i) {
    for (int j = i; j; j = (j - 1) & i) {
      int x = j, y = i ^ j;
      if (x > MAXN || y > MAXN || !cnt[x] || !cnt[y]) continue;
      x = get_fa(x), y = get_fa(y);
      if (x == y) continue;
      int sx = (!vis[x] ? cnt[x] : 1);
      int sy = (!vis[y] ? cnt[y] : 1);
      ans += (long long)i * (sx + sy - 1);
      vis[x] = vis[y] = 1;
      fa[x] = y;
    }
  }
  cout << ans << endl;
  return 0;
}