def primes(n):
    ret=[]
    for i in range(2,int(n**0.5)+1):
        if n%i==0:
            ret.append(i)
        while n%i==0:
            n//=i
    if n!=1:
        ret.append(n)
    return ret

n=int(input())
arr=list(map(int,input().split()))
ans=2**n-1
for i in range(n):
    cand=primes(arr[i])
    for f in range(1,2**len(cand)):
        flag=format(f,'b')
        flag='0'*(len(cand)-len(flag))+flag
        tmp=1
        for k in range(len(cand)):
            if flag[k]=='1':
                tmp*=cand[k]
        cnt=0
        for j in range(i+1,n):
            if arr[j]%tmp==0:
                cnt+=1
        if flag.count('1')%2==0:
            ans+=2**cnt
        else:
            ans-=2**cnt
print(ans)