#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

struct UnionFind{
    vector<int> par,num;
    UnionFind(int n):par(n),num(n,1){
        iota(par.begin(),par.end(),0);  //include<numeric>
    }
    int find(int v){
        return (par[v]==v)?v:(par[v]=find(par[v]));
    }
    void unite(int u,int v){
        u=find(u),v=find(v);
        if(u==v)return;
        if(num[u]<num[v])swap(u,v);
        num[u]+=num[v];
        par[v]=u;
    }
    bool same(int u,int v){
        return find(u) == find(v);
    }
    int size(int v){
        return num[find(v)];
    }
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> a(n);
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    int m = a.back();
    vector<bool> ex(m+1);
    ll res = 0;
    for(int i=0;i<n;i++){
        ex[a[i]] = 1;
        if(i and a[i] == a[i-1]){
            res += a[i];
        }
    }
    UnionFind uf(m+1);
    vector<pair<ll,pair<int,int>>> v;
    for(int g=1;g<=m;g++){
        int f = -1;
        for(int i=g;i<=m;i+=g){
            if(ex[i]){
                if(f == -1){
                    f = i;
                }
                else{
                    v.push_back({(ll)f*(ll)i/g, {f,i}});
                }
            }
        }
    }
    sort(v.begin(), v.end());
    for(auto p:v){
        int x = p.second.first, y = p.second.second;
        if(!uf.same(x,y)){
            uf.unite(x,y);
            res += p.first;
        }
    }
    cout << res << endl;
}