#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define vi vector #define vs vector #define vc vector #define vl vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e){ cerr << e << endl; } template void debug(vector &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(map &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } int main(){ ll N; cin >> N; vl A(N); rep(i,N) cin >> A[i]; sort(all(A)); vl sum(400006, 0); vl count(400006, 0); rep(i,N){ sum[A[i]] += A[i]; count[A[i]] += 1; } rep(i,400005){ sum[i + 1] += sum[i]; count[i + 1] += count[i]; } ll ans = 0; for (ll i = N - 1; i >= 0; i--){ for (ll j = 1; j * A[i] <= 200000; j++){//A[i] * j + 0 から A[i] * j + A[i] - 1 まで ll b_sum = sum[A[i] * j + A[i] - 1] - sum[A[i] * j - 1]; if (j == 1){ b_sum = sum[A[i] + A[i] - 1] - sum[A[i]]; } ll cnt = count[A[i] * j + A[i] - 1] - count[A[i] * j - 1]; if (j == 1){ cnt = count[A[i] + A[i] - 1] - count[A[i]]; } ll anssub = A[i] * cnt * (j + 1); anssub -= b_sum; ans += anssub; } //debug(ans); } cout << ans << endl; }