#ifndef LOCAL
#include <bits/stdc++.h>

using namespace std;

#define debug(...) (void(0))
#else
#include "algo/debug.h"
#endif

void solve() {
    int N;
    cin >> N;
    vector<int> A(N);
    for (auto& x : A) cin >> x;
    sort(A.begin(), A.end());
    uint64_t ans = 0;
    for (int i = 0; i < N; i++) ans += (int64_t)N * A[i];
    constexpr int M = 2e5 + 100;
    vector<int> S(M);
    for (const auto& x : A) S[x]++;
    for (int j = 1; j <= M; j++)
        if (S[j]) {
            for (int i = j; i < M; i += j) {
                int k = distance(lower_bound(A.begin(), A.end(), i), lower_bound(A.begin(), A.end(), i + j));
                int64_t val = i / j;
                ans -= val * j * k * S[j];
            }
        }
    cout << ans << endl;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int tt = 1;
    // std::cin >> tt;
    while (tt--) {
        solve();
    }
}