#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
// 素因数分解
std::vector<std::pair<long long, int>> primeFactorization(long long n) {
	std::vector<std::pair<long long, int>> ret;
	for (long long i = 2; i*i <= n; i++) {
		int c = 0;
		while (n%i == 0) { // 素数で割り切れなくなるまで割っていく
			c++;//割った個数を配列に足す
			n /= i;
		}
		if (0 != c) ret.push_back({ i,c });
		if (1 == n) break;
	}
	if (1 != n) ret.push_back({ n,1 });
	return ret;
}
long long solve(vector<int>a) {
	auto list = primeFactorization(a[0]);
	long long ret = 0;
	rep2(i, 1, a.size()) {
		if (1 != gcd(a[0], a[i]))continue;
		else ret += list[0].first;
	}
	return ret;
}
class Osa_k {
public:
	Osa_k(int max = 1000006) {
		size = max + 1;
		osa_k.resize(size);
	}
	void init() {
		osa_k[1] = 1;
		for (int i = 2; i < size + 1; ++i) {
			if (0 != osa_k[i])continue;
			osa_k[i] = i;
			for (int j = i * 2; j <= size; j += i) {
				if (0 == osa_k[j]) osa_k[j] = i;
			}
		}
	}
	std::vector<int> osk(int n) {
		std::vector<int>ret;
		while (1 != n) {
			ret.push_back(osa_k[n]);
			n /= osa_k[n];
		}
		return ret;
	}
	std::vector<std::pair<int, int>>oskPair(int n) {
		auto ps = osk(n);
		std::vector<std::pair<int, int>> result;
		for (int i = 0; i < ps.size();) {
			int j = i + 1;
			while (j < ps.size() && ps[i] == ps[j])j++;
			result.emplace_back(ps[i], j - i);
			i = j;
		}
		return result;
	}
private:
	int size;
	std::vector<int>osa_k;
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	long long ans = LINF;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	map<int, int>mp;
	Osa_k osk(200005);
	osk.init();
	std::vector<std::vector<std::pair<int, int>>> p(n);
	rep(i, n) {
		p[i] = osk.oskPair(a[i]);
		for (auto e : p[i]) {
			if (mp.count(e.first))continue;
			mp[e.first] = mp.size();
		}
	}
	if (0 == mp.size()) {
		cout << 2 * n << endl;
		return 0;
	}
	dsu uf(n + mp.size());
	rep(i, n) {
		for (auto e : p[i]) {
			uf.merge(i, n + mp[e.first]);
		}
	}
	auto g = uf.groups();
	auto mnPrime = (*mp.begin()).first;
	if (1 == g.size()) {
		cout << 0 << endl;
	}
	else {
		long long ans = LINF;
		chmin(ans, (long long)(g.size()) * 2);
		chmin(ans, (long long)(g.size() - 1) * mnPrime);
		cout << ans << endl;
	}
	return 0;
}