#include <bits/stdc++.h>

using namespace std;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  
  int n;
  cin >> n;
  vector<long long> a(n);
  for (int i = 0; i < n; i++)
    cin >> a[i];

  sort(a.begin(), a.end());
  
  vector<long long> pref(n + 1);
  for (int i = 0; i < n; i++)
    pref[i+1] = pref[i] + a[i];
  
  long long ret = 0;
  for (int i = 0; i < n; ) {
    int j = i;
    while (j < n && a[j] == a[i])
      ++j;
    long long x = pref[i];
    for (long long s = a[i]; s <= a[n-1]; s += a[i]) {
      long long t = s + a[i];
      int p = lower_bound(a.begin(), a.end(), s) - a.begin();
      int q = lower_bound(a.begin(), a.end(), t) - a.begin();
      ret += (pref[q] - pref[p]) - (q - p) * s;
    }
    ret += (j - i) * x;
    i = j;
  }
  
  cout << ret << endl;
  
  return 0;
}