CF1113B.Sasha and Magnetic Machines

One day Sasha visited the farmer 2D and his famous magnetic farm. On this farm, the crop grows due to the influence of a special magnetic field. Maintaining of the magnetic field is provided by $n$ machines, and the power of the $i$-th machine is $a_i$.

This year 2D decided to cultivate a new culture, but what exactly he didn't say. For the successful growth of the new culture, it is necessary to slightly change the powers of the machines. 2D can at most once choose an arbitrary integer $x$, then choose one machine and reduce the power of its machine by $x$ times, and at the same time increase the power of one another machine by $x$ times (powers of all the machines must stay positive integers). Note that he may not do that if he wants. More formally, 2D can choose two such indices $i$ and $j$, and one integer $x$ such that $x$ is a divisor of $a_i$, and change powers as following: $a_i = \frac{a_i}{x}$, $a_j = a_j \cdot x$

Sasha is very curious, that's why he wants to calculate the minimum total power the farmer can reach. There are too many machines, and Sasha can't cope with computations, help him!

一天，萨沙拜访了农夫2D和他的著名磁力农场。在这个农场上，作物的生长依赖于一种特殊的磁场。该磁场由 $n$ 台机器维持，第 $i$ 台机器的功率为 $a_i$。

今年，2D 决定培育一种新作物，但他并未透露具体是哪一种。为了使这种新作物成功生长，必须对各台机器的功率进行轻微调整。2D 最多可执行一次如下操作：任选一个整数 $x$，再任选一台机器将其功率缩小 $x$ 倍，同时任选另一台（不同的）机器将其功率增大 $x$ 倍（所有机器的功率必须始终保持为正整数）。注意：他也可以选择不执行该操作。更形式化地说，2D 可以选择两个下标 $i$ 和 $j$（$i \ne j$），以及一个整数 $x$，使得 $x$ 是 $a_i$ 的约数，并按如下方式更新功率：$a_i = \frac{a_i}{x}$，$a_j = a_j \cdot x$。

萨沙非常好奇，因此他想计算农夫所能达到的最小总功率。机器数量太多，萨沙无法独立完成计算，请你帮助他！

The first line contains one integer $n$ ($2 \le n \le 5 \cdot 10^4$) — the number of machines.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 100$) — the powers of the machines.

第一行包含一个整数 $n$（$2 \le n \le 5 \cdot 10^4$）——机器的数量。

第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \le a_i \le 100$）——各台机器的功率。

Print one integer — minimum total power.

输出一个整数——最小总能量。

In the first example, the farmer can reduce the power of the $4$-th machine by $2$ times, and increase the power of the $1$-st machine by $2$ times, then the powers will be: $[2, 2, 3, 2, 5]$.

In the second example, the farmer can reduce the power of the $3$-rd machine by $2$ times, and increase the power of the $2$-nd machine by $2$ times. At the same time, the farmer can leave is be as it is and the total power won't change.

In the third example, it is optimal to leave it be as it is.

在第一个例子中，农民可以将第 $4$ 台机器的功率降低为原来的 $\frac{1}{2}$，并将第 $1$ 台机器的功率提升为原来的 $2$ 倍，此时各台机器的功率变为：$[2, 2, 3, 2, 5]$。

在第二个例子中，农民可以将第 $3$ 台机器的功率降低为原来的 $\frac{1}{2}$，并将第 $2$ 台机器的功率提升为原来的 $2$ 倍。同时，农民也可以选择不做任何操作，此时总功率保持不变。

在第三个例子中，最优策略是不做任何操作。