#include <bits/stdc++.h>
#include <math.h>

#include <algorithm>
#include <array>
#include <atcoder/all>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>

using namespace std;
using namespace atcoder;

using Graph = vector<vector<int>>;

using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;

const ll INF_ll = 1e17;
const int INF = 1e8;
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main() {
  int N;
  cin >> N;
  vector<ll> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  sort(A.begin(), A.end());
  vector<ll> sumA(N + 1, 0);
  for (int i = 0; i < N; i++) {
    sumA[i + 1] = sumA[i] + A[i];
  }
  ll ans = 0;
  for (int i = 0; i < N; i++) {
    ll prev = 0;
    for (ll j = 1; (j - 1) * A[i] <= A.back(); j++) {
      ll id = lower_bound(A.begin(), A.end(), j * A[i]) - A.begin();
      ans += (sumA[id] - sumA[prev]) - (j - 1) * A[i] * (id - prev);
      prev = id;
    }
    // cout << i << "," << ans << endl;
  }
  cout << ans << endl;

  return 0;
}