#include <iostream>
#include <numeric>
#include <vector>

using lint = long long;
constexpr int X = 200000;

void solve() {
    int n;
    std::cin >> n;

    std::vector<lint> cnt(X + 1, 0);
    for (int i = 0; i < n; ++i) {
        int x;
        std::cin >> x;
        ++cnt[x];
    }

    std::vector<lint> sums(X + 1, 0);
    for (lint x = 1; x <= X; ++x) {
        for (int y = x; y <= X; y += x) {
            sums[y] += cnt[x] * x;
        }
    }

    for (int i = 1; i <= X; ++i) sums[i] += sums[i - 1];

    std::vector<lint> vals(X + 1);
    for (lint i = 0; i <= X; ++i) vals[i] = i * n - sums[i];

    lint ans = 0;
    for (int x = 0; x <= X; ++x) ans += cnt[x] * vals[x];
    std::cout << ans << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}