from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
# setrecursionlimit(2000000) # これこどふぉだと無理
# set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 10**18
from collections import defaultdict,deque
from heapq import heappop,heappush
# from random import randint
# from itertools import permutations 

# https://yukicoder.me/problems/no/2756
class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        t=x
        while self.parents[x] >= 0:
            x=self.parents[x]
        while t!=x:
            self.parents[t],t=x,self.parents[t]
        return x

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:  
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())


n = ii()
a = li()
a = set(a) 
a = sorted(a)

m = max(a)
cnt = [0]*(m+1) 
pos = dict()
for i,x in enumerate(a):
    pos[x] = i 

uf = UnionFind(len(a))


for i in a:
    cnt[i] = 1 

for i in range(2,m+1):
    tmp = []
    for j in range(i,m+1,i):
        if cnt[j]:
            tmp.append(j) 
    if not tmp:
        continue 
    for x in tmp:
        uf.union(pos[x],pos[tmp[0]])

st = a[0] 
memo = uf.all_group_members()

if len(memo) == 2:
    for i in a:
        if i % 3 == 0:
            print(3) 
            exit()

cnt = 0 
for i in a:
    if i % 2 == 0:
        cnt = 1  

#print(memo)
print(2*(len(memo)-cnt))