#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

void solve() {
    int N;
    cin >> N;
    vll A(N);
    ll S = 0;
    rep(i, N) {
        cin >> A[i];
        S += A[i];
    }
    sort(all(A));

    ll ans = 0;
    for (int i = 0; i < N;) {
        ll x = S / A[i] * A[i] + S % A[i];
        for (int j = 1;; ++j) {
            auto it = lower_bound(begin(A), end(A), A[i] * j);
            if (it == end(A)) {
                break;
            }
            int n = (int)(end(A) - it);
            x -= A[i] * n;
        }
        int t = i;
        for (; i < N && A[i] == A[t]; ++i) {
            ans += x;
        }
    }
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}