#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

const int MX = 200010;

int main() {
    int N;
    cin >> N;
    V<int> A(N);
    rep(i, N) cin >> A[i];
    sort(ALL(A));

    V<int> cnt(MX);
    V<ll> csum(MX), psum(MX);
    rep(i, N) cnt[A[i]]++;
    rep(i, MX - 1) {
        csum[i + 1] = csum[i] + cnt[i];
        psum[i + 1] = psum[i] + cnt[i] * ll(i);
    }

    ll ans = 0;

    for (int i = 1; i < MX; ++i) {
        if (!cnt[i]) continue;
        for (int j = i; j < MX; j += i) {
            ll a = psum[min(MX - 1, j + i)] - psum[j] -
                   j * (csum[min(MX - 1, j + i)] - csum[j]);
            ans += a * cnt[i];
        }
    }

    int s = 0;

    for (int i = N - 1; i >= 0;) {
        int j = i;
        while (j >= 0 && A[j] == A[i]) --j;
        ans += (ll)A[i] * s * (i - j);
        s += (i - j);
        i = j;
    }

    cout << ans << endl;

    return 0;
}