//#pragma GCC target("avx2,avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //#include //using namespace atcoder; //using mint = modint998244353; //using mint = modint1000000007; #include using namespace std; //#include //#include //using namespace __gnu_pbds; //using i128 = __int128_t; using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; #define rep(i, n) for(int i = 0; i < (n); ++i) #define all(x) (x).begin(),(x).end() #define SZ(x) ((int)(x).size()) constexpr char ln = '\n'; template inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;} template inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;} inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);} inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);} inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);} inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);} inline int popcount(int x) {return __builtin_popcount(x);} inline int popcount(long long x) {return __builtin_popcountll(x);} inline int kthbit(long long x, int k) {return (x>>k)&1;} inline void print() {cout << "\n";} template inline void print(const vector &v) { for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " "; print(); } template inline void print(const T &x, const Args &... args) { cout << x << " "; print(args...); } #ifdef MINATO_LOCAL #define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl; inline void debug() {cerr << endl;} template inline void debug(const vector &v) { for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " "; debug(); } template inline void debug(const T &x, const Args &... args) { cerr << x << " "; debug(args...); } #else #define dump(x) void(0) inline void debug() {} template inline void debug(const vector &v) {} template inline void debug(const T &x, const Args &... args) {} #endif struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios; //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// const ll MAX = 200000; int main() { int N; cin >> N; vector A(N); rep(i,N) cin >> A[i]; sort(all(A)); vector CA(N+1); rep(i,N) CA[i+1] = CA[i]+A[i]; auto get=[&](int l, int r) {return CA[r]-CA[l];}; ll ans = 0; ll pre = 0; rep(i,N) { if (i and A[i]==A[i-1]) { ans += pre; continue; } pre = 0; for (ll R = A[i]; R <= MAX+1; R += A[i]) { ll L = R-A[i]; ll p = lower_bound(all(A),L) - A.begin(); ll q = lower_bound(all(A),R) - A.begin(); pre += get(p,q) - L*(q-p); } ans += pre; } cout << ans << ln; }