#include<bits/stdc++.h>
using namespace std;

const int N = 2e5 + 10;

int n, a[N], p = 0, pos[N];
long long ans, sum[N];

int main(){
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  freopen("mod.in", "r", stdin);
  freopen("mod.out", "w", stdout);

//  freopen("samples2.in", "r", stdin);
//  freopen("sample.ans", "w", stdout);
//  cout << log2(200000);
  cin >> n;
  for(int i = 1; i <= n; i++){
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n);
  pos[n] = n + 1;
  for(int i = n; i >= 2; i--){
    if(a[i - 1] != a[i]){
      pos[i - 1] = i;
    }
    else{
      pos[i - 1] = pos[i];
    }
  }
  for(int i = 1; i <= n; i++){
    for(int j = pos[i]; j <= n; j++){
      ans += a[j] % a[i];
    }
    ans += sum[p];
    if(a[i] != a[i + 1]){
      p = i;
    }
    sum[i] = sum[i - 1] + a[i];
    //cout << sum[i] << " ";
  }
  cout << ans;
  return 0;
}