#include <bits/stdc++.h>
using namespace std;
vector<int> prime;
vector<bool> isp(5001, true);
void sieve() {
  int limit = sqrt(5001 + .0);
  isp[0] = isp[1] = false;
  prime.push_back(2);
  for (int i = 4; i < 5001; i += 2) isp[i] = false;
  for (int i = 3; i < 5001; i += 2) {
    if (isp[i]) {
      prime.push_back(i);
      if (i < limit) {
        for (int j = i * i; j < 5001; j += 2 * i) isp[j] = false;
      }
    }
  }
}
long long dp[5001][700];
void build_dp() {
  memset(dp, 0, sizeof(dp));
  for (int i = 2; i < 5001; i++) {
    int temp = i;
    for (int j = 0; j < prime.size(); j++) {
      dp[i][j] = dp[i - 1][j];
      while (temp % prime[j] == 0) {
        temp /= prime[j];
        dp[i][j]++;
      }
    }
  }
}
void cumulate_dp() {
  for (int i = 2; i < 5001; i++)
    for (int j = 1; j < 700; j++) dp[i][j] += dp[i][j - 1];
}
void print_dp() {
  for (int i = 0; i < 10; i++) {
    cout << i << " --> ";
    for (int j = 0; j < 4; j++) {
      cout << prime[j] << "->" << dp[i][j] << " ";
    }
    cout << endl;
  }
  cout << endl;
}
int lpf(int n, int k) {
  return lower_bound(dp[n], dp[n] + 700, dp[n][700 - 1] - k) - dp[n];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  sieve();
  build_dp();
  cumulate_dp();
  int n, temp;
  cin >> n;
  vector<int> mark(5001, 0);
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> temp;
    if (temp > 1) {
      mark[temp]++;
      sum += dp[temp][700 - 1];
    }
  }
  for (int it = 0;; it++) {
    vector<int> track(700, 0);
    int mx = 0, mxidx = -1;
    for (int k = 0; k < 5001; k++) {
      if (!mark[k] || dp[k][700 - 1] <= it) continue;
      int idx = lpf(k, it);
      track[idx] += mark[k];
      if (track[idx] > mx) {
        mx = track[idx];
        mxidx = idx;
      }
    }
    if (mx <= n - mx) break;
    for (int k = 0; k < 5001; k++) {
      if (!mark[k] || dp[k][700 - 1] <= it) continue;
      int idx = lpf(k, it);
      if (idx != mxidx) mark[k] = 0;
    }
    sum += n - mx;
    sum -= mx;
  }
  cout << sum << endl;
  return 0;
}
