Problem: [Æsir - CHAOS](https://soundcloud.com/kivawu/aesir-chaos)

[Æsir - V.](https://soundcloud.com/kivawu/aesir-v)

"Everything has been planned out. No more hidden concerns. The condition of Cytus is also perfect.

The time right now...... 00:01:12......

It's time."

The emotion samples are now sufficient. After almost 3 years, it's time for Ivy to awake her bonded sister, Vanessa.

The system inside A.R.C.'s Library core can be considered as an undirected graph with infinite number of processing nodes, numbered with all positive integers (1, 2, 3, …). The node with a number x (x > 1), is directly connected with a node with number (x)/(f(x)), with f(x) being the lowest prime divisor of x.

Vanessa's mind is divided into n fragments. Due to more than 500 years of coma, the fragments have been scattered: the i-th fragment is now located at the node with a number k_i! (a factorial of k_i).

To maximize the chance of successful awakening, Ivy decides to place the samples in a node P, so that the total length of paths from each fragment to P is smallest possible. If there are multiple fragments located at the same node, the path from that node to P needs to be counted multiple times.

In the world of zeros and ones, such a requirement is very simple for Ivy. Not longer than a second later, she has already figured out such a node.

But for a mere human like you, is this still possible?

For simplicity, please answer the minimal sum of paths' lengths from every fragment to the emotion samples' assembly node P.

Input

The first line contains an integer n (1 ≤ n ≤ 10^6) — number of fragments of Vanessa's mind.

The second line contains n integers: k_1, k_2, …, k_n (0 ≤ k_i ≤ 5000), denoting the nodes where fragments of Vanessa's mind are located: the i-th fragment is at the node with a number k_i!.

Output

Print a single integer, denoting the minimal sum of path from every fragment to the node with the emotion samples (a.k.a. node P).

As a reminder, if there are multiple fragments at the same node, the distance from that node to P needs to be counted multiple times as well.

Examples

Input


3
2 1 4


Output


5


Input


4
3 1 4 4


Output


6


Input


4
3 1 4 1


Output


6


Input


5
3 1 4 1 5


Output


11

Note

Considering the first 24 nodes of the system, the node network will look as follows (the nodes 1!, 2!, 3!, 4! are drawn bold):

<image>

For the first example, Ivy will place the emotion samples at the node 1. From here:

  * The distance from Vanessa's first fragment to the node 1 is 1. 
  * The distance from Vanessa's second fragment to the node 1 is 0. 
  * The distance from Vanessa's third fragment to the node 1 is 4. 



The total length is 5.

For the second example, the assembly node will be 6. From here:

  * The distance from Vanessa's first fragment to the node 6 is 0. 
  * The distance from Vanessa's second fragment to the node 6 is 2. 
  * The distance from Vanessa's third fragment to the node 6 is 2. 
  * The distance from Vanessa's fourth fragment to the node 6 is again 2. 



The total path length is 6.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 5005, M = 700;
long long ans;
int n, m, cnt, p[M], a[N], f[N][M];
pair<int, int> g1[N], g2[N], g3[N];
int main() {
  scanf("%d", &n);
  for (int i = 0, x; i < n; ++i)
    scanf("%d", &x), ++a[x = max(x, 1)], m = max(m, x);
  for (int i = 2; i <= m; ++i) {
    for (int j = 1; j <= cnt; ++j)
      if (i % p[j] == 0) goto skip;
    p[++cnt] = i;
  skip:;
  }
  for (int i = 1; i <= m; ++i) {
    memcpy(f[i], f[i - 1], M << 2);
    for (int j = 1, x = i; j <= cnt; ++j)
      while (x % p[j] == 0) x /= p[j], ++f[i][j], f[i][0] = max(f[i][0], j);
  }
  for (int i = 1; i <= m; ++i) {
    int c1 = 0, c2 = 0;
    for (int j = i - 1; j; --j) {
      int k = max(f[i][0], f[j][0]), tot = 0;
      while (f[i][k] == f[j][k]) tot += f[i][k], --k;
      g1[++c1] = make_pair(tot + min(f[i][k], f[j][k]), a[j]);
    }
    for (int j = i; j <= m; ++j) {
      int k = max(f[i][0], f[j][0]), tot = 0;
      while (f[i][k] == f[j][k] && k > 1) tot += f[i][k], --k;
      g2[++c2] = make_pair(tot + min(f[i][k], f[j][k]), a[j]);
    }
    int c3 = 0;
    while (c1 || c2)
      if (c1 && (g1[c1] < g2[c2] || !c2))
        g3[++c3] = g1[c1--];
      else
        g3[++c3] = g2[c2--];
    long long now = 0;
    for (int j = 1, rest = n; j <= m; ++j) {
      now += (long long)g3[j].second * g3[j].first, rest -= g3[j].second;
      ans = min(ans, (long long)g3[j].first * (n - 2 * rest) - 2 * now);
    }
  }
  for (int i = 1; i <= m; ++i)
    for (int j = 1; j <= cnt; ++j) ans += (long long)a[i] * f[i][j];
  printf("%lld\n", ans);
  return 0;
}