import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.lang.AssertionError import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 fun divisors(x: Int): MutableList { val res = mutableListOf() val post = mutableListOf() var d = 1 while (d * d <= x) { if (x % d == 0) { res += d if (d * d != x) post += x / d } ++d } for (i in post.size - 1 downTo 0) { res += post[i] } return res } tailrec fun gcd(a: Int, b: Int): Int { if (b == 0) return abs(a) return gcd(b, a % b) } class Solver(stream: InputStream, private val out: java.io.PrintWriter) { private val reader = BufferedReader(InputStreamReader(stream), 32768) fun solve() { val N = ni() val A = na(N) val MAX = 100_000 val D = Array(MAX + 1){divisors(it)} val C = IntArray(MAX + 1) for (a in A) { C[a]++ } val bests = Array(MAX + 1){ mutableListOf() } for (d in 1 .. MAX) { var y = d while(y <= MAX) { if (C[y] > 0) bests[d].add(y) y += d } } fun calc(a: Int): Long { val divs = D[a] var best = 1e9.toInt() for (i in divs.indices) { val d = divs[i] if (bests[d].isEmpty()) continue val b = if (bests[d][0] != a || C[a] > 1) bests[d][0] else bests[d].getOrNull(1) ?: continue best = min(best, b / gcd(a, b)) } debug{"clac($a)=$best"} return best.toLong() * a } val candidates = mutableListOf() for (a in 1 .. MAX) { for (i in 0 until C[a]) candidates += calc(a) } candidates.sort() debug{candidates.toString()} val ans = candidates.slice(1 until N).sum() out.println(ans) } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return IntArray(n) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } /** * コーナーケースでエラー出たりするので、debug(dp[1])のように添え字付きの場合はdebug{}をつかうこと */ private inline fun debug(a: LongArray) { debug { a.joinToString(" ") } } private inline fun debug(a: IntArray) { debug { a.joinToString(" ") } } private inline fun debug(a: BooleanArray) { debug { toString(a) } } private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")} private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()} private inline fun assert(b: Boolean, f: () -> String) = run{if (!b) throw AssertionError(f())} companion object { // TestRunnerから呼びたいので単純なmainじゃだめ fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() } } } /** * judgeから呼ばれる */ fun main() = Solver.main()