#include <bits/stdc++.h>
using namespace std;
const long long mod = 1610612741ll;
const int maxn = 1e6 + 10;
int n, top, sz, k[maxn], val[maxn], np[maxn];
map<long long, int> mp;
vector<pair<int, int> > sta[maxn], a[maxn];
vector<pair<int, int> > t[5010];
bool ispri[maxn];
int pri[maxn], vis[maxn];
vector<pair<int, int> > g[maxn];
long long dp[maxn], sum[maxn];
int Hash(vector<pair<int, int> > x) {
  long long p = 1;
  for (auto it : x) {
    p = (p * 131 % mod + it.first) % mod;
    p = (p * 131 % mod + it.second) % mod;
  }
  return p;
}
void sieve(int n) {
  ispri[0] = ispri[1] = true;
  pri[0] = 0;
  for (int i = 2; i <= n; i++) {
    if (!ispri[i]) pri[++pri[0]] = i;
    for (int j = 1; j <= pri[0] && i * pri[j] <= n; j++) {
      ispri[i * pri[j]] = true;
      if (i % pri[j] == 0) break;
    }
  }
}
void init() {
  for (int i = 1; i <= 5000; i++) {
    for (int j = 1; pri[j] <= i && j <= pri[0]; j++) {
      int x = i, cnt = 0;
      while (x) {
        cnt += x / pri[j];
        x /= pri[j];
      }
      t[i].push_back(pair<int, int>(pri[j], cnt));
    }
    reverse(t[i].begin(), t[i].end());
    np[i] = mp[Hash(t[i])] = ++sz;
  }
}
int cmp(vector<pair<int, int> > x, vector<pair<int, int> > y) {
  for (int i = 0; i < min(x.size(), y.size()); i++) {
    if (x[i].first != y[i].first) {
      return x[i].first > y[i].first ? 1 : -1;
    } else if (x[i].second != y[i].second) {
      if (i == x.size() - 1 && i != y.size() - 1)
        return 1;
      else if (i != x.size() - 1 && i == y.size() - 1)
        return -1;
      else if (i == x.size() - 1 && i == y.size() - 1) {
        return x[i].second > y[i].second ? 1 : -1;
      } else {
        return x[i].second < y[i].second ? 1 : -1;
      }
    }
  }
  if (x.size() < y.size())
    return 1;
  else if (x.size() == y.size())
    return 0;
  else
    return -1;
}
int cmp2(vector<pair<int, int> > x, vector<pair<int, int> > y) {
  for (int i = 0; i < min(x.size(), y.size()); i++) {
    if (x[i].first != y[i].first) {
      return x[i].first > y[i].first;
    } else if (x[i].second != y[i].second) {
      if (i == x.size() - 1 && i != y.size() - 1)
        return 1;
      else if (i != x.size() - 1 && i == y.size() - 1)
        return 0;
      else if (i == x.size() - 1 && i == y.size() - 1)
        return x[i].second < y[i].second;
      else
        return x[i].second > y[i].second;
    }
  }
  return x.size() < y.size();
}
int cal(vector<pair<int, int> > x, vector<pair<int, int> > y) {
  int cnt = 0;
  for (int i = 0; i < x.size(); i++) {
    if (i >= y.size())
      cnt += x[i].second;
    else
      cnt += x[i].second - y[i].second;
  }
  return cnt;
}
vector<pair<int, int> > getlca(vector<pair<int, int> > x,
                               vector<pair<int, int> > y) {
  vector<pair<int, int> > g;
  for (int i = 0; i < min(x.size(), y.size()); i++) {
    if (x[i].first != y[i].first)
      break;
    else if (x[i].second != y[i].second) {
      g.push_back(pair<int, int>(x[i].first, min(x[i].second, y[i].second)));
      break;
    } else {
      g.push_back(pair<int, int>(x[i].first, x[i].second));
    }
  }
  if (!g.size()) return t[1];
  return g;
}
void insert(vector<pair<int, int> > x) {
  vector<pair<int, int> > lca = getlca(x, sta[top]);
  while (top > 1 && cmp(lca, sta[top - 1]) >= 0) {
    int u = Hash(sta[top - 1]), v = Hash(sta[top]);
    if (!mp[u]) mp[u] = ++sz;
    if (!mp[v]) mp[v] = ++sz;
    u = mp[u], v = mp[v];
    g[u].push_back(pair<int, int>(v, cal(sta[top], sta[top - 1])));
    top--;
  }
  if (lca != sta[top]) {
    int u = Hash(lca), v = Hash(sta[top]);
    if (!mp[u]) mp[u] = ++sz;
    if (!mp[v]) mp[v] = ++sz;
    u = mp[u], v = mp[v];
    g[u].push_back(pair<int, int>(v, cal(sta[top], lca)));
    sta[top] = lca;
  }
  sta[++top] = x;
}
void build() {
  vector<pair<int, int> > q[5010];
  for (int i = 1; i <= 5000; i++) q[i] = t[i];
  sort(q + 1, q + 5000 + 1, cmp2);
  sta[top = 1] = t[1];
  for (int i = q[1] == t[1] ? 2 : 1; i <= 5000; i++) insert(q[i]);
  for (int i = 1; i < top; i++) {
    int u = Hash(sta[i]), v = Hash(sta[i + 1]);
    if (!mp[u]) mp[u] = ++sz;
    if (!mp[v]) mp[v] = ++sz;
    u = mp[u], v = mp[v];
    g[u].push_back(pair<int, int>(v, cal(sta[i + 1], sta[i])));
  }
}
void dfs1(int u) {
  dp[u] = 0, sum[u] = val[u];
  vis[u] = 1;
  for (auto it : g[u]) {
    if (vis[it.first]) continue;
    dfs1(it.first);
    sum[u] += sum[it.first];
    dp[u] += dp[it.first] + sum[it.first] * it.second;
  }
}
void dfs2(int u, long long &ans) {
  vis[u] = 1;
  for (auto it : g[u]) {
    if (vis[it.first]) continue;
    dp[it.first] += dp[u] - dp[it.first] - sum[it.first] * it.second;
    dp[it.first] += (sum[u] - sum[it.first]) * it.second;
    sum[it.first] = sum[u];
    dfs2(it.first, ans);
  }
  ans = min(ans, dp[u]);
}
inline int read() {
  char c = getchar();
  int x = 0, f = 1;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x * f;
}
int main() {
  sieve(5000);
  init();
  build();
  n = read();
  int tot = 0;
  for (int i = 1, x; i <= n; i++) {
    x = read();
    if (x == 0) x++;
    val[x]++;
  }
  long long ans = 1e15;
  dfs1(1);
  memset(vis, 0, sizeof vis);
  dfs2(1, ans);
  printf("%lld\n", ans);
  return 0;
}
