import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt(); auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong(); } const lim = cast(int)(A.maxElement + 1); auto bs = new long[lim + 1]; foreach (i; 0 .. N) { bs[cast(int)(A[i])] += A[i]; } foreach (a; 0 .. lim) { bs[a + 1] += bs[a]; } long ans = N * A.sum; /* foreach (i; 0 .. N) { for (long x = 0, y; x < A[i]; x = y) { const z = A[i] / (x + 1); y = A[i] / z; // (x, y]: z ans -= z * (bs[cast(int)(y)] - bs[cast(int)(x)]); } } */ foreach (a; 1 .. lim) { if (bs[a] - bs[a - 1] > 0) { long sum; for (long x = 0, y; x < a; x = y) { const z = a / (x + 1); y = a / z; // (x, y]: z sum += z * (bs[cast(int)(y)] - bs[cast(int)(x)]); } ans -= (bs[a] - bs[a - 1]) / a * sum; } } writeln(ans); } } catch (EOFException e) { } }