#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

const int L=2e5;

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

  int N;
  cin>>N;
  vector<ll> A(N);
  rep(i,N) cin>>A[i];
  sort(all(A));

  vector<ll> num(L+10,0);
  rep(i,N) num[A[i]]++;
  vector<ll> nsum(L+10,0);
  for(int i=1;i<=L;i++) nsum[i]+=nsum[i-1]+num[i];

  vector<ll> sum(L+10,0);
  rep(i,N) sum[A[i]]+=A[i];
  for(int i=1;i<=L;i++) sum[i]+=sum[i-1];

  ll ans=0;
  for(int i=1;i<=L;i++){
    if(num[i]==0) continue;

    ll res=0;
    for(int k=0;i*k<=L;k++){
      ll tn=nsum[min(L,i*(k+1)-1)]-nsum[max(0,i*k-1)];
      res+=(sum[min(L,i*(k+1)-1)]-sum[max(0,i*k-1)])-tn*i*k;
    }

    ans+=res*num[i];
  }
  cout<<ans<<endl;

  return 0;
}