#include <bits/stdc++.h>
using namespace std;
// #define LOCAL // 提出時はコメントアウト
#define DEBUG_

typedef long long ll;
const double EPS = 1e-9;
const ll INF = ((1LL<<62)-(1LL<<31));
typedef vector<ll> vecl;
typedef pair<ll, ll> pairl;
template<typename T, typename U> using mapv = map<T,vector<U>>;

#define ALL(v) v.begin(), v.end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define contains(S,x) find(ALL(S),x) != S.end()
ll llceil(ll a,ll b) { return (a+b-1)/b; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> vector<vector<T>> genarr(ll n, ll m, T init) { return vector<vector<T>>(n,vector<T>(m,init)); }

///// DEBUG
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template<typename T>istream&operator>>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<typename T,typename U>ostream&operator<<(ostream&os,pair<T,U>&pair_var){os<<"("<<pair_var.first<<", "<<pair_var.second<<")";return os;}
template<typename T>ostream&operator<<(ostream&os,const vector<T>&vec){os<<"{";for(int i=0;i<vec.size();i++){os<<vec[i]<<(i+1==vec.size()?"":", ");}
os<<"}";return os;}
template<typename T,typename U>ostream&operator<<(ostream&os,map<T,U>&map_var){os<<"{";repi(itr,map_var){os<<*itr;itr++;if(itr!=map_var.end())os<<", ";itr--;}
os<<"}";return os;}
template<typename T>ostream&operator<<(ostream&os,set<T>&set_var){os<<"{";repi(itr,set_var){os<<*itr;itr++;if(itr!=set_var.end())os<<", ";itr--;}
os<<"}";return os;}
void dump_func(){DUMPOUT<<endl;}
template<class Head,class...Tail>void dump_func(Head&&head,Tail&&...tail){DUMPOUT<<head;if(sizeof...(Tail)>0){DUMPOUT<<", ";}
dump_func(std::move(tail)...);}
#ifndef LOCAL
#undef DEBUG_
#endif
#ifdef DEBUG_
#define DEB
#define dump(...)                                                          \
DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
        << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
        << endl                                                            \
        << "    ",                                                         \
    dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

//////////

template<typename T>
class Accumulation {
    public: 
        vector<T> v;
        Accumulation(const vector<ll> &X,ll N, ll init_val=0) {
            v.assign(N+1,0);
            v[0] = init_val;
            rep(i,N) {
                v[i+1] = v[i] + X[i];
            }
        }

        T query(ll l,ll r) { // [0,r]
            return v[r+1] - v[l];
        }
};

template<typename T>
class Counter {
  public:
    unordered_map<T,ll> memo;
    void add(T x) {
      if (memo.count(x) == 0) memo[x] = 0;
      memo[x]++;
    }

    void decrement(T x) {
      memo[x]--;
      if (memo[x]<=0) memo.erase(x);
    }
};

int main() {
    #ifdef LOCAL
    ifstream in("../../Atcoder/input.txt");
    cin.rdbuf(in.rdbuf());
    #endif

    ll N;
    cin>>N;

    vecl A(N);
    ll sum = 0;
    ll max = 0;
    Counter<ll> C;

    rep(i,N) {
        cin>>A[i];
        sum += A[i];
        chmax(max,A[i]);
        C.add(A[i]);
    }

    vecl distribution(max+10,0LL);
    unordered_set<ll> calced;
    rep(i,N) {
        if (calced.count(A[i]) > 0) continue;
        ll b = A[i];
        while (b < max+10) {
            distribution[b] += A[i] * C.memo[A[i]];
            b += A[i];
        }

        calced.insert(A[i]);
    }

    Accumulation<ll> db_acc(distribution,max+20);
    ll ans = 0;
    rep(i,N) {
        ans += sum;
        ans -= db_acc.query(0,A[i]);
    }

    cout << ans << endl;


    return 0;
}