在原数组中搜索能互质的数---在剩下的数中搜索能互质的数

n=int(input())
b=list(map(int,input().split()))
def gcd(a,b):
    if a%b == 0:
        return b
    else:
        return gcd(b,a%b)

res=0
def dfs(t):
    global res,b
    if len(b)<1:
        return 
    for x in b:
        if len(t)==0:
            t.append(x)
        else:
            flag=0
            for y in t:
                if gcd(x,y)!=1:
                    flag=1
                    break
            if flag==0:
                t.append(x)
    #print(t)
    res+=1
    for x in t:
        b.remove(x)
    dfs([])

dfs([])
print(res)