#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	for (int i = 0; i < N; ++i) {
		cin >> A[i];
	}
	int mx = *max_element(A.begin(), A.end());
	int bits = 0;
	while ((1 << bits) <= mx) ++bits;
	vector<int> cnt(1 << bits);
	for (int i = 0; i < N; ++i) {
		++cnt[A[i]];
	}
	vector<long long> decr(1 << bits);
	for (int i = 1; i < 1 << bits; ++i) {
		for (int j = i; j < 1 << bits; j += i) {
			decr[i] += cnt[j] * j / i * (i - 1);
		}
	}
	long long asum = 0;
	for (int i = 0; i < N; ++i) {
		asum += A[i];
	}
	for (int i = 0; i < N; ++i) {
		sort(A.begin(), A.end(), greater<int>());
		if (A[i] == 0) break;
		for (int j = 0; j < N; ++j) {
			if (j != i && A[j] > (A[j] ^ A[i])) {
				A[j] ^= A[i];
			}
		}
	}
	while (!A.empty() && A.back() == 0) A.pop_back();
	vector<int> B;
	for (int i : A) {
		for (int j = i; j < 1 << bits; j *= 2) {
			B.push_back(j);
		}
	}
	for (int i = 0; i < B.size(); ++i) {
		sort(B.begin(), B.end(), greater<int>());
		if (B[i] == 0) break;
		for (int j = 0; j < N; ++j) {
			if (j != i && B[j] > (B[j] ^ B[i])) {
				B[j] ^= B[i];
			}
		}
	}
	while (!B.empty() && B.back() == 0) B.pop_back();
	long long maxdec = 0;
	for (int i = 1; i < 1 << B.size(); ++i) {
		int xorsum = 0;
		for (int j = 0; j < B.size(); ++j) {
			if ((i >> j) & 1) xorsum ^= B[j];
		}
		maxdec = max(maxdec, decr[xorsum]);
	}
	cout << asum - maxdec << endl;
	return 0;
}