#include #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define all(v) begin(v), end(v) using namespace std; using ll = long long; template bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; } template bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; } constexpr ll inf = 1e18; class UnionFind { vector par; public: UnionFind(int n) : par(n, -1) {} int find(int x) { return par[x] < 0 ? x : par[x] = find(par[x]); } bool merge(int x, int y) { x = find(x); y = find(y); if (x == y) return false; if (par[x] > par[y]) swap(x, y); par[x] += par[y]; par[y] = x; return true; } int size(int x) { return -par[find(x)]; } }; int main() { int N; cin >> N; vector A(N); rep (i, N) cin >> A[i]; vector> B; rep (i, N) rep (j, i) B.emplace_back(lcm(A[i], A[j]), i, j); sort(all(B)); UnionFind uf(N); ll ans = 0; for (auto [c, a, b] : B) if (uf.merge(a, b)) ans += c; cout << ans << endl; }