/* -*- coding: utf-8 -*-
 *
 * 2756.cc:  No.2756 GCD Teleporter - yukicoder
 */

#include<cstdio>
#include<vector>
#include<set>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_P = 200000;
const int MAX_GN = MAX_N + MAX_P;

/* typedef */

using vb = vector<bool>;
using vi = vector<int>;
using si = set<int>;

struct UFT {
  vector<int> links, ranks, sizes;
  UFT() {}

  void init(int n) {
    links.resize(n);
    for (int i = 0; i < n; i++) links[i] = i;
    ranks.assign(n, 1);
    sizes.assign(n, 1);
  }

  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }

  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }

  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};

/* global variables */

vb primes;
vi pnums;
int as[MAX_N];
UFT uft;

/* subroutines */

int gen_primes(int maxp) {
  primes.assign(maxp + 1, true);
  primes[0] = primes[1] = false;

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums.push_back(p);
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums.push_back(p);
  return (int)pnums.size();
}

bool prime_decomp(int n, vi& pis) {
  pis.clear();

  for (int i = 0; i < pnums.size(); i++) {
    int pi = pnums[i];
    if (pi * pi > n) {
      if (n > 1) {
	int j =
	  lower_bound(pnums.begin(), pnums.end(), n) - pnums.begin();
	pis.push_back(j);
      }
      return true;
    }

    if (n % pi == 0) {
      while (n % pi == 0) n /= pi;
      pis.push_back(i);
    }
  }
  return false;
}

/* subroutines */

/* main */

int main() {
  int pn = gen_primes(MAX_P);
  //printf(" pn=%d\n", pn);

  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  
  int gn = n + pn;
  uft.init(gn);

  for (int i = 0; i < n; i++) {
    vi pis;
    prime_decomp(as[i], pis);
    for (auto j: pis)
      uft.merge(i, n + j);
  }

  si gs;
  for (int i = 0; i < n; i++) gs.insert(uft.root(i));
  //for (auto u: gs) printf(" %d", u); putchar('\n');

  if (gs.size() == 1) puts("0");
  else {
    int r2 = uft.root(n), r3 = uft.root(n + 1);
    int sum2 = 0, sum3 = 0;
    for (auto u: gs) {
      if (u != r2) sum2 += 2;
      if (u != r3) sum3 += 3;
    }

    printf("%d\n", min(sum2, sum3));
  }

  return 0;
}