#include using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using tp = tuple; template using vec = vector; template using vvec = vector>; #define all(hoge) (hoge).begin(), (hoge).end() #define en '\n' #define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i) #define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i) #define REP(i, n) rep(i, 0, n) #define REP2(i, n) rep2(i, 0, n) constexpr long long INF = 1LL << 60; constexpr int INF_INT = 1 << 25; // constexpr long long MOD = (ll)1e9 + 7; constexpr long long MOD = 998244353LL; static const ld pi = 3.141592653589793L; #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") template inline bool chmin(T &a, T b) { if(a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if(a < b) { a = b; return true; } return false; } //グラフ関連 struct Edge { int to, rev; ll cap; Edge(int _to, int _rev, ll _cap) : to(_to), rev(_rev), cap(_cap) {} }; typedef vector Edges; typedef vector Graph; void add_edge(Graph &G, int from, int to, ll cap, bool revFlag, ll revCap) { G[from].push_back(Edge(to, (int)G[to].size(), cap)); if(revFlag) G[to].push_back(Edge(from, (int)G[from].size() - 1, revCap)); } class UnionFind { vector data; int num; public: UnionFind(int size) : data(size, -1), num(size) {} bool unionSet(int x, int y) { x = root(x); y = root(y); if(x != y) { if(data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x; num--; } return x != y; } bool findSet(int x, int y) { return root(x) == root(y); } int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); } int size(int x) { return -data[root(x)]; } int numSet() { return num; } }; vector divisor(ll n) { vector ret; for(ll i = 1; i * i <= n; i++) { if(n % i == 0) { ret.push_back(i); if(i * i != n) ret.push_back(n / i); } } sort(ret.begin(), ret.end()); return ret; } void solve() { ll n; cin >> n; vec a(n); REP(i, n) { cin >> a[i]; } ll ma = 2020202; vec num(ma, 0); vvec vs(ma); ll ans = 0; sort(all(a)); vec b; REP(i, n) { num[a[i]]++; if(num[a[i]] >= 2) { ans += a[i]; continue; } int k = b.size(); b.push_back(a[i]); for(int j = 1; j * a[i] < ma; j++) { vs[j * a[i]].push_back(k); } } UnionFind uni(b.size()); REP(i, ma) { if(vs[i].size() <= 1) continue; rep(j, 1, vs[i].size()) { if(uni.unionSet(vs[i][0], vs[i][j])) { ans += i; } } if(uni.size(0) == b.size()) break; } if(uni.size(0) != b.size()) { REP(i, b.size()) { auto d = divisor(b[i]); for(auto p : d) { if(vs[i].size()) if(uni.unionSet(i, vs[i][0])) ans += gcd(vs[i][0], i); } if(uni.size(i) == 1 and i != 0) { uni.unionSet(i, 0); ans += gcd(b[i], b[0]); } } } assert(uni.size(0) == b.size()); cout << ans << en; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); // cout << fixed << setprecision(10); // ll t; // cin >> t; // REP(i, t - 1) { // solve(); // } solve(); return 0; }