#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long linf = 1LL << 62;
const unsigned long long ulinf = 1ULL << 63;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T a) {
  return a >= 0 ? a : -a;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
long long powmod(long long a, long long b, long long c) {
  if (b == 0) return 1;
  long long ret = powmod(a, b >> 1, c);
  ret = ret * ret % c;
  if (b & 1) ret = ret * a % c;
  return ret;
}
template <class T>
void maxe(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void mine(T &a, T b) {
  if (a > b) a = b;
}
int iszero(double a) { return abs(a) <= eps; }
template <class T>
void geti(T &a) {
  a = 0;
  T b = 1;
  char c = getchar();
  if (c == '-')
    b = -1;
  else
    a = c - 48;
  while ((c = getchar()) != ' ' && c != '\n') a = a * 10 + c - 48;
  a *= b;
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 1111111;
const int M = 11;
int test;
int n, m, k, ans;
long long p[N], b[N];
long long a[M];
int d[M];
int pe[M];
int cntp;
long long s[M];
int sd[M], t[M];
void precalc() {
  for (long long i = 2; i < N; i++)
    for (long long j = i; j < N; j += i)
      if (!b[j]) b[j] = i;
  for (long long i = 2; i < N; i++)
    if (b[i] == i) p[++cntp] = i;
}
int f(long long s) {
  int ret = 0;
  for (int i = 1; i <= cntp && p[i] * p[i] <= s; i++)
    if (s % p[i] == 0) {
      while (s % p[i] == 0) {
        s /= p[i];
        ret++;
      }
    }
  if (s > 1) ret++;
  return ret;
}
void perm(int k) {
  if (k <= n) {
    for (int i = k; i <= n; i++) {
      swap(pe[i], pe[k]);
      perm(k + 1);
      swap(pe[i], pe[k]);
    }
  } else {
    for (int i = 1; i <= n; i++) {
      s[i] = a[pe[i]];
      sd[i] = d[pe[i]];
      t[i] = 0;
    }
    int res = 1, flag = 0;
    for (int i = 2; i <= n; i++) {
      res++;
      int ff = 0;
      for (int j = 1; j < i; j++)
        if (s[j] % s[i] == 0) {
          ff = 1;
          s[j] /= s[i];
          sd[j] -= sd[i];
          t[j] = 1;
          break;
        }
      if (!ff) flag = 1;
    }
    if (flag) res++;
    for (int i = 1; i <= n; i++)
      if (t[i] || sd[i] > 1) res += sd[i];
    mine(ans, res);
  }
}
int main() {
  precalc();
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
    d[i] = f(a[i]);
    pe[i] = i;
  }
  ans = inf;
  perm(1);
  printf("%d\n", ans);
  return 0;
}
