#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  sort(A.begin(), A.end());
  vector<long long> S(N + 1);
  S[0] = 0;
  for (int i = 0; i < N; i++){
    S[i + 1] = S[i] + A[i];
  }
  long long ans = 0;
  for (int i = 0; i < N; i++){
    ans += (long long) A[i] * (N - 1 - i);
    for (int j = A[i]; j <= 200000; j += A[i]){
      int L;
      if (j == A[i]){
        L = lower_bound(A.begin(), A.end(), j + 1) - A.begin();
      } else {
        L = lower_bound(A.begin(), A.end(), j) - A.begin();
      }
      int R = lower_bound(A.begin(), A.end(), j + A[i]) - A.begin();
      if (L < R){
        ans -= S[R] - S[L] - (long long) (R - L) * j;
      }
    }
  }
  cout << ans << endl;
}