const int MX = 100005;

int cnt[MX], b[MX];
int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios_base :: sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int n, x;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> x; cnt[x]++;
    }
    for (int i = MX - 1; i >= 1; i--) {
        b[i] = b[i + 1] + cnt[i];
    }
    long long res = 0;
    for (int i = 1; i < MX; i++) {
        if (cnt[i] == 0) {
            continue;
        }
        for (int j = i, mul = 1; j < MX; j += i, mul++) {
            /// there are b[j] - b[j + i] elements which adds mul to the ans
            res += 1LL * (b[j] - b[min(MX - 1, j + i)]) * mul * cnt[i]; /// *cnt[i] because we have cnt[i] times i
        }
    }
    cout << res << endl;
    return 0;
}