#include #include 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 P pair template inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n; cin >> n; vectora(n); const int m = 200000; vectorcnt(m + 1); rep(i, n)cin >> a[i], cnt[a[i]]++; long long ans = 0; rep(i, m + 1)if (cnt[i]) { ans += (long long)i * (cnt[i] - 1); cnt[i] = 1; } vector>e; rep2(g, 1, m + 1) { int mn = INF; for (int i = g; i <= m; i += g) { if (cnt[i])chmin(mn, i); } if (mn == INF)continue; for (int i = g; i <= m; i += g) { if (cnt[i])e.emplace_back(lcm(mn, i), mn, i); } } sort(all(e)); dsu uf(m + 1); for (auto [l, u, v] : e) { if (uf.same(u, v))continue; uf.merge(u, v); ans += l; } cout << ans << endl; return 0; }