#include #include #include #include #include #include int main() { using namespace std; unsigned N; cin >> N; vector A(N); for (auto&& a : A) cin >> a; ranges::sort(A); const auto M{ranges::max(A)}; vector> values(M + 1); unsigned long ans{}; for (const auto &[i, a] : A | views::enumerate) if (!values[a]) values[a] = i; else ans += a; set> edges; for (unsigned i{1}; i <= M; ++i) for (unsigned j{i}, mn{N}, mx{}; j <= M; j += i) if (values[j]) { mn = min(mn, *values[j]); mx = max(mx, *values[j]); edges.emplace(lcm(A[mn] + 0ul, A[mx]), mn, mx); } vector uf(N), sz(N, 1); iota(begin(uf), end(uf), 0u); const auto find{[&uf](auto i) { while (i != uf[i]) i = uf[i] = uf[uf[i]]; return i; }}; const auto unite{[&uf, &sz, &find](auto i, auto j) { i = find(i); j = find(j); if (i == j) return false; if (sz[i] < sz[j]) swap(i, j); sz[i] += sz[j]; uf[j] = i; return true; }}; for (const auto& [c, i, j] : edges) if (unite(i, j)) ans += c; cout << ans << endl; return 0; }