#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, ans=0;
    cin >> N;
    vector<ll> A(N+1), S(5e5+1);
    for (int i=1; i<=N; i++){
        cin >> A[i];
        S[A[i]]++;
    }
    sort(A.begin(), A.end());
    for (int i=1; i<=5e5; i++) S[i] += S[i-1];

    for (int i=1; i<=N; i++) ans += (N-i*2+1) * A[i];

    for (ll i=1; i<=N; i++){
        for (ll j=A[i]; j<=2e5; j+=A[i]){
            ans += j/A[i] * (S[A[i]+j-1]-S[j-1]) * A[i];
        }
        ans -= A[i];
    }

    cout << ans << endl;

    return 0;
}