#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<vector<ll>> graph(N + 200000, vector<ll>(0));
    dsu tree(N + 200000);
    for (ll i = 0; i < N; i++) {
        ll A_cpy = A[i];
        for (ll j = 2; j * j <= 200000; j++) {
            bool pos = false;
            while (true) {
                if (A_cpy % j != 0) {
                    break;
                }
                A_cpy /= j;
                pos = true;
            }
            if (pos) {
                graph[i].push_back(N + j);
                graph[N + j].push_back(i);
                tree.merge(N + j, i);
            }
        }
        if (A_cpy != 1) {
            graph[i].push_back(A_cpy + N);
            graph[N + A_cpy].push_back(i);
            tree.merge(N + A_cpy, i);
        }
    }
    vector<bool> isvisited(N + 200000, false);
    queue<ll> que;
    ll comp_num = 0;
    for (ll i = 0; i < N; i++) {
        if (isvisited[i]) {
            continue;
        }
        isvisited[i] = true;
        que.push(i);
        comp_num++;
        while (que.size()) {
            ll p = que.front();
            que.pop();
            for (ll x : graph[p]) {
                if (isvisited[x]) {
                    continue;
                }
                isvisited[x] = true;
                que.push(x);
            }
        }
    }
    bool connect_2 = false;
    for (ll i = 0; i < N; i++) {
        if (tree.same(i, N + 2)) {
            connect_2 = true;
        }
    }
    if (comp_num == 1) {
        cout << 0 << endl;
    } else if (comp_num >= 3) {
        if (connect_2) {
            cout << (comp_num - 1) * 2 << endl;
        } else {
            cout << comp_num * 2 << endl;
        }
    } else {
        bool connect_3 = false;
        for (ll i = 0; i < N; i++) {
            if (tree.same(i, N + 3)) {
                connect_3 = true;
            }
        }
        if (connect_2) {
            cout << 2 << endl;
        } else if (connect_3) {
            cout << 3 << endl;
        } else {
            cout << 4 << endl;
        }
    }
}