#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e6 + 5;

int n;
ll a[N], dp[N], lst[65];

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		for (int j = 0; j < 60; j++) dp[i] = max(dp[i], dp[lst[j]] + (a[i] & a[lst[j]]));
		int s = 0;
		ll t = a[i];
		while (t) t >>= 1, s++;
		lst[s] = i;
	}
	printf("%d", dp[n]);
	return 0;
}