#include <bits/stdc++.h>
using namespace std;
const long long N = 5007, INF = 3e18;
struct Node {
  long long cnt = 0, cnt0 = 0;
  Node *pr;
  map<long long, Node *> go;
  Node() {}
};
bool isprime(long long n) {
  long long i = 2;
  while (i * i <= n) {
    if (n % i == 0) return 0;
    i++;
  }
  return 1;
}
vector<long long> pr;
vector<long long> fact[N];
long long cntt[N];
Node *tail[N];
long long allsz;
Node *head = new Node();
long long ans = INF;
void add(long long x, long long w) {
  Node *t = head;
  long long s = 0;
  for (long long elem : fact[x]) s += elem;
  for (long long i = allsz - 1; i >= 0; i--) {
    t->cnt += s * w;
    t->cnt0 += w;
    s -= fact[x][i];
    if (t->go.find(fact[x][i]) == t->go.end()) t->go[fact[x][i]] = new Node();
    t = t->go[fact[x][i]];
  }
}
void init() {
  pr.push_back(0);
  for (long long i = 2; i < N; i++) {
    if (isprime(i)) pr.push_back(i);
  }
  allsz = pr.size();
  fact[0].assign(allsz, 0);
  for (long long i = 1; i < N; i++) {
    fact[i] = fact[i - 1];
    long long n = i;
    for (long long j = 1; j < allsz; j++) {
      while (n % pr[j] == 0) {
        n /= pr[j];
        fact[i][j]++;
      }
      if (n == 1) break;
    }
  }
}
void rec(Node *t, long long res = 0, long long cnt = 0) {
  long long s = 0, cnt0 = 0;
  long long less = 0, more = 0;
  for (auto elem : t->go) {
    s += elem.second->cnt;
    cnt0 += elem.second->cnt0;
    more += elem.first * elem.second->cnt0;
  }
  long long cless = 0, cmore = cnt0;
  if (s + res + more < ans) {
  }
  ans = min(ans, s + res + more);
  long long pst = 0;
  for (auto elem : t->go) {
    less += (elem.first - pst) * cless;
    more -= (elem.first - pst) * cmore;
    cmore -= elem.second->cnt0;
    cless += elem.second->cnt0;
    long long ncnt = cnt + (cnt0 - elem.second->cnt0);
    long long nres =
        res + cnt * elem.first + (s - elem.second->cnt) + less + more;
    rec(elem.second, nres, ncnt);
    pst = elem.first;
  }
}
signed main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  init();
  long long n;
  cin >> n;
  memset(cntt, 0, sizeof(cntt));
  for (long long i = 0; i < n; i++) {
    long long x;
    cin >> x;
    cntt[x]++;
  }
  for (long long i = 0; i < N; i++) {
    if (cntt[i] != 0) add(i, cntt[i]);
  }
  rec(head);
  cout << ans << endl;
  return 0;
}
