#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = 0;
//---------------------------------//

int N;
int A[112345], cnt[112345];

int main() {
	cin >> N;
	REP(i, N) {
		scanf("%d", A + i);
		++cnt[A[i]];
	}
	
	int maxa = *max_element(A, A + N);
	
	vector<int> v(N);
	REP(i, N) v[i] = A[i];
	
	int mn = INF;
	for (int k = 25; k >= 0; k--) if (!v.empty()) {
		sort(ALL(v), greater<int>());
		
		int mx = v[0];
		if (mx >> k & 1 ^ 1) continue;
		chmin(mn, mx);
		REP(i, v.size()) if (v[i] >> k & 1) v[i] = v[i] ^ mx;
	}
	
	ll ansd = 0;
	FOR(i, mn, maxa + 1) {
		ll cur = 0;
		for (int j = i; j <= maxa; j += i) {
			cur += (ll)cnt[j] * j - j / i * (ll)cnt[j];
		}
		chmax(ansd, cur);
	}
	
	ll ans = accumulate(A, A + N, 0ll);
	ans -= ansd;
	
	cout << ans << endl;
	
	return 0;
}