#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>a(n);
	long long ans = 0;
	rep(i, n) {
		cin >> a[i];
		ans += a[i];
	}
	sort(all(a));
	a.erase(unique(all(a)), a.end());
	vector<int>memo(100005, -1);
	rep(i, a.size()) {
		ans -= a[i];
		memo[a[i]] = i;
	}
	vector<pair<long long, P>>edge;
	rep2(i, 1, a.back() + 1) {
		vector<pair<long long,int>>v;
		for (int j = i; j <= 100000; j += i) {
			if (-1 != memo[j])v.push_back({ j,memo[j] });
		}
		if (v.size() <= 1)continue;
		rep2(j, 1, v.size()) {
			long long dist = v[0].first * v[j].first / (long long)i;
			edge.push_back({ dist,{v[0].second,v[j].second} });
		}
	}
	dsu uf(a.size());
	sort(all(edge));
	rep(i, edge.size()) {
		long long d = edge[i].first;
		int x = edge[i].second.first;
		int y = edge[i].second.second;
		if (uf.same(x, y)) continue;
		uf.merge(x, y);
		ans += d;
	}
	cout << ans << endl;
	return 0;
}