#include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

lint cnt[MAX], cnt_sum[MAX], sum[MAX];

int main() {
    int n;
    scanf("%d", &n);
    rep(i, n) {
        int a;
        scanf("%d", &a);
        ++cnt[a];
        ++cnt_sum[a + 1];
        sum[a + 1] += a;
    }
    partial_sum(cnt_sum, cnt_sum + MAX, cnt_sum);
    partial_sum(sum, sum + MAX, sum);

    lint ans = 0;
    rep(i, MAX) if (cnt[i]) {
        for (int k = 0; k * i <= 200000; ++k) {
            int l = k * i, r = min(MAX - 1, (k + 1) * i);
            ans += ((sum[r] - sum[l]) - (cnt_sum[r] - cnt_sum[l]) * i * k) *
                   cnt[i];
        }
    }
    printf("%lld\n", ans);
}