#include typedef long long int ll; constexpr int kN = int(2E5 + 10); int a[kN]; ll s[kN], cnt[kN], ss[kN]; int main() { int n, tmp, nxt; ll ans = 0; scanf("%d", &n); for (int i = 1; i <= n; i++) scanf("%d", &a[i]); for (int i = 1; i <= n; i++) cnt[a[i]]++; for (int i = 1; i < kN; i++) s[i] = s[i - 1] + cnt[i]; for (int i = 1; i < kN; i++) ss[i] = ss[i - 1] + i * cnt[i]; for (int i = 1; i < kN; i++) { for (int j = 1; j <= i; j = nxt + 1) { tmp = i / j; nxt = i / tmp; ans -= tmp * cnt[i] * (ss[nxt] - ss[j - 1]); } } for (int i = 1; i < kN; i++) ans += s[kN - 1] * i * cnt[i]; printf("%lld\n", ans); }