#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

void run_case() {
    int N;
    cin >> N;
    vector<int> A(N);
    rep(i, N) cin >> A[i];
    const int MAX = 2e5 + 10;
    vector<vector<int>> B(MAX);
    rep(i, N) B[A[i]].pb(i);
    atcoder::dsu uf(N);
    rep(i, MAX) rep(j, (int)B[i].size() - 1) uf.merge(B[i][j], B[i][j + 1]);
    rep(x, 2, MAX) {
        vector<int> C;
        rep(y, x, MAX, x) if (!B[y].empty()) C.pb(B[y].back());
        rep(i, (int)C.size() - 1) uf.merge(C[i], C[i + 1]);
    }
    auto grs = uf.groups();
    int cc = grs.size();
    if (cc == 1) {
        cout << 0 << "\n";
        return;
    }
    bool f2 = false, f3 = false;
    rep(i, (int)grs.size()) {
        if (A[grs[i].front()] % 2 == 0) f2 = true;
        if (A[grs[i].front()] % 3 == 0) f3 = true;
    }
    if (f2) {
        cout << 2 * (cc - 1) << "\n";
    } else if (f3) {
        cout << 3 * (cc - 1) << "\n";
    } else {
        cout << 2 * cc << "\n";
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    // cin >> T;
    while (T--) run_case();
    return 0;
}