#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int MAXN = 2e5 + 5, MAXV = 2e5 + 5;

int n, a[MAXN], cnt[MAXV];
ll ans;

int main(){
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n;
  for(int i = 1; i <= n; i++){
    cin >> a[i];
    cnt[a[i]]++;
  }
  sort(a + 1, a + 1 + n);
  for(int i = a[n]; i >= 1; i--){
    cnt[i] += cnt[i + 1];
  }
  for(int i = 1; i <= n; i++){
    ans += 1ll * a[i] * n;
  }
  for(int i = 1; i <= n; i++){
    bool f = 0;
    for(int j = a[i]; j <= a[n]; j += a[i]){
      int p1 = lower_bound(a + 1, a + 1 + n, j) - a, p2 = (!f ? lower_bound(a + 1, a + 1 + n, j + a[i]) - a : 0);
      f |= (p2 == n + 1);
      if(a[p1] - j < a[i]){
        ans -= 1ll * j * (cnt[a[p1]] - cnt[a[p2]]);
      }
    }
  }
  cout << ans;
  return 0;
}