#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <tuple>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <ranges>
#include <iomanip>
using namespace std;
using ll = long long;

auto range(int n) { return views::iota(0, n); }

template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

ll brute(vector<int> vs) {
  ll res = 0;
  int n = vs.size();
  for (int i : range(n))
  for (int j : range(n)) res += vs[i] % vs[j];
  return res;
}

int solve() {
  int n; cin >> n;
  vector<int> vs(n);
  for (int i : range(n)) cin >> vs[i];

  dump(brute(vs));

  const int M = 200010;
  vector<int> ws(M);

  for (int i : range(n)) {
    ws[vs[i]]++;
  }

  vector<ll> ps0(M), ps1(M);
  for (ll i = 1; i < M; ++i) {
    ps0[i] = ps0[i - 1] + ws[i];
    ps1[i] = ps1[i - 1] + i * ws[i];
  }
  dump(ps0)
  dump(ps1)

  ll res = 0;
  for (int j = 1; j < M; ++j) if (ws[j]) {
    res += ps1[j - 1];

    for (int b = j; b < M; b += j) {
      int e = min(M - 1, b + j - 1);

      res += (ps1[e] - ps1[b - 1]) - (ps0[e] - ps0[b - 1]) * b;
    }
  }
  return res;
}

int main() {
  cout << fixed << setprecision(12);
  cout << solve() << endl;
}