#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

template<typename T>
class CumulativeSum {
    const int n;
    std::vector<T> sum_data;
public:
    CumulativeSum(vector<T> data) : n(data.size()) {
        sum_data.resize(n + 1);
        for (int i = 0; i < n; i++) {
            sum_data[i + 1] = sum_data[i] + data[i];
        }
    }

    // 区間 [l, r) 番目の範囲の和を求める．(l = r のときは 0 を返す．)
    T sum(int l, int r) const {
        assert(0 <= l && l <= r && r <= n);
        return sum_data[r] - sum_data[l];
    }
};

typedef CumulativeSum<ll> CumSum;


int main() {
    vector<ll> A(200010);
    vector<ll> B(200010);
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
        int x;
        cin >> x;
        A[x]++;
        B[x] += x;
    }
    CumSum cnt(A);
    CumSum sum(B);

    long long ans = 0;
    for (int i = 1; i <= 200000; i++) {
        for (int j = 0; j <= 200000; j += i) {
            ll C = cnt.sum(j, min(j+i, 200001));
            ll S = sum.sum(j, min(j+i, 200001));
            ans += A[i] * (S - C * j);
        }
    }
    cout << ans << endl;

}