#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <cassert>
#include <unordered_map>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

//using mint = modint998244353;
#define rep(i,n) for (int i=0;i<n;i+=1)
#define rrep(i,n) for (int i=n-1;i>-1;i--)
#define append push_back
#define all(x) (x).begin(), (x).end()

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<endl;
}

ll lpow(int n,int k){
  ll res = 1;
  ll e = n;
  while (k){
    if (k&1){
      res *= e;
    }
    e = e * e;
    k >>= 1;
  }
  return res;
}




int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int N;
  cin>>N;
  vec<int> cnt(1e6+1,0);
  int M = 1e6;
  rep(i,N){
      int a;
      cin>>a;
      cnt[a]++;
  }

  ll res = 0;
  vec<int> A;
  for (int i=1;i<=M;i++){
      if (cnt[i] > 1){
          res += i * (cnt[i]-1);
          cnt[i] = 1;
      }
      if (cnt[i]==0){continue;}
      A.append(i);
      for (int j=2*i;j<=M;j+=i){
          if (cnt[j]!=0){
              res += j * cnt[j];
              cnt[j] = 0;
          }
      }
  }

  int n  = A.size();
  vec<tuple<ll,int,int>> Edge;
  rep(i,n){
      rep(j,n){
          if (i < j){
              ll cost = lcm((ll)A[i],(ll)A[j]);
              Edge.append({cost,i,j});
          }
      }
  }
  sort(all(Edge));

  dsu uf(n);
  for (auto [c,u,v]:Edge){
      if (!uf.same(u,v)){
          res += c;
          uf.merge(u,v);
      }
  }

  cout<<res<<endl;
}