#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

constexpr int MAX = 200000;
int dist[MAX + 5];
int distsum[MAX + 5];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    vector<int> A(N);
    ll S = 0;
    for(int i = 0; i < N; ++i){
        cin >> A[i];
        dist[A[i]] += 1;
        S += A[i];
    }
    for(int i = 0; i <= MAX; ++i){
        distsum[i + 1] = distsum[i] + dist[i];
    }

    ll sum = 0;
    for(int i = 1; i <= MAX; ++i){
        if(dist[i] == 0)    continue;
        ll floorsum = 0;
        for(int l = i; l <= MAX; l += i){
            int r = min(MAX + 1, l + i);
            floorsum += (ll)(distsum[r] - distsum[l]) * (l / i);
        }
        sum += floorsum * i * dist[i];
    }
    
    cout << S * N - sum << endl;

    return 0;
}