#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;

template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

using namespace std;
template <typename T>
void fwt(vector<T>& f) {
    int n = f.size();
    for (int i = 1; i < n; i <<= 1) {
        for (int j = 0; j < n; j++) {
            if ((j & i) == 0) {
                T x = f[j], y = f[j | i];
                f[j] = x + y, f[j | i] = x - y;
            }
        }
    }
}
template <typename T>
void ifwt(vector<T>& f) {
    int n = f.size();
    for (int i = 1; i < n; i <<= 1) {
        for (int j = 0; j < n; j++) {
            if ((j & i) == 0) {
                T x = f[j], y = f[j | i];
                f[j] = (x + y) / 2, f[j | i] = (x - y) / 2;
            }
        }
    }
}

int main() {
	int n; scanf("%d", &n); std::vector<int> a(n);
	for(int i = 0; i < n; i++) scanf("%d", &a[i]);

	// pre
	std::vector<i64> vec(1e5 + 1, 0);
	for(int i = 0; i < n; i++) vec[a[i]]++;

	// solve
	std::vector<i64> p(1 << 17, 1LL << 60);
	{ // p[k] := k にうるとらそーどを使った時の和
		i64 sum = 0;
		for(i64 i = 1; i < vec.size(); i++) sum += vec[i] * i;
		for(i64 i = 1; i < vec.size(); i++) {
			p[i] = sum;
			for(i64 j = i; j < vec.size(); j += i) p[i] -= vec[j] * (j - j / i);
		}
	}

	std::vector<i64> dp(1 << 17, 0); dp[0] = 1;
	for(int i = 0; i < n; i++) {
		int tmp = a[i];
		while(tmp < dp.size()) {
			dp[tmp] = 1;
			tmp <<= 1;
		}
	}
	fwt(dp);
	for(int i = 0; i < dp.size(); i++) dp[i] = dp[i] * dp[i];
	ifwt(dp);
	
	i64 ans = 1LL << 60;
	for(int i = 1; i < dp.size(); i++) {
		if(dp[i]) {
			ans = std::min(ans, p[i]);
		}
	}
	printf("%lld\n", ans);
	return 0;
}