#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

class UnionFind {
public:
  vector<int> _parent;
  vector<int> _rank;
  vector<int> _size;

  UnionFind(int n) {
    for (int i = 0; i < n; ++i) {
      _parent.push_back(i);
      _rank.push_back(0);
      _size.push_back(1);
    }
  }

  int find(int x) {
    if (_parent[x] == x) {
      return x;
    } else {
      return _parent[x] = find(_parent[x]);
    }
  }

  void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;

    if (_rank[x] < _rank[y]) {
      _parent[x] = y;
      _size[y] += _size[x];
    } else {
      _parent[y] = x;
      _size[x] += _size[y];
      if (_rank[x] == _rank[y]) ++_rank[x];
    }
  }

  bool same(int x, int y) {
    return find(x) == find(y);
  }

  int size(int x) {
    return _size[find(x)];
  }
};

int main() {
  int N;
  cin >> N;
  vector<ll> A(N);
  vector<ll> counter(100010, 0);
  ll min_a = INT_MAX;

  for (int i = 0; i < N; ++i) {
    cin >> A[i];
    counter[A[i]]++;
    min_a = min(min_a, A[i]);
  }

  sort(A.begin(), A.end());
  vector<bool> checked(100010, false);

  ll ans = 0;
  UnionFind uf(100010);

  for (int i = 0; i < N; ++i) {
    ll a = A[i];
    if (checked[a]) continue;
    checked[a] = true;

    ans += a * (counter[a] - 1);

    for (ll x = 2 * a; x <= 100000; x += a) {
      if (checked[x]) continue;
      checked[x] = true;

      uf.unite(a, x);
      ans += x * counter[x];
    }
  }

  for (ll a : A) {
    if (uf.same(min_a, a)) continue;

    uf.unite(min_a, a);
    ans += min_a * a;
  }

  cout << ans << endl;

  return 0;
}