#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 2e5 + 10, INF = 2e9;

ll n, a[MAXN], s[MAXN];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    s[i] = s[i - 1] + a[i];
  }
  ll ans = 0;
  for (int i = 1; i <= n; i++) {
    ll sum = a[i] * n;
    for (int l = 1, r; l <= n; l = r + 1) {
      int val = a[i] / a[l] == 0 ? INF : a[i] / (a[i] / a[l]);
      r = upper_bound(a + 1, a + n + 1, val) - a - 1;
      sum -= (s[r] - s[l - 1]) * (a[i] / a[l]);
    }
    ans += sum;
  }
  cout << ans;
  return 0;
}