#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr int MX = 100010;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  VVI vals(MX);
  rep(i, n) {
    cin >> a[i];
    vals[a[i]].emplace_back(i);
  }
  ll ans = 0;
  dsu uf(n);
  constexpr ll INF = 1002003004005006007;
  vector<pair<ll, pair<int, int>>> mns;
  while(true) {
    auto gs = uf.groups();
    if (gs.size() == 1) break;
    mns.assign(n, {INF, {-1, -1}});
    for(int g = 1; g < MX; g++) {
      int i1 = -1;
      int li1 = -1;
      int v = -1;
      for(int x = g; x < MX; x += g) {
        for(int i: vals[x]) {
          if (i1 == -1) {
            i1 = i;
            li1 = uf.leader(i1);
            v = a[i1] / g;
          } else if (int li = uf.leader(i); li != li1) {
            ll cost = (ll)v * a[i];
            if (cost < mns[li1].first) {
              mns[li1] = {cost, {i1, i}};
            }
            if (cost < mns[li].first) {
              mns[li] = {cost, {i1, i}};
            }
          }
        }
      }
    }
    rep(l, n) if (mns[l].first != INF) {
      auto [cost, ij] = mns[l];
      auto [i, j] = ij;
      if (!uf.same(i, j)) {
        ans += cost;
        uf.merge(i, j);
      }
    }
  }
  cout << ans << endl;
}