http://noi.openjudge.cn/math/7834/
参考:
信息学奥赛一本通(1221:分成互质组)
https://blog.csdn.net/lvcheng0309/article/details/118118800
https://blog.csdn.net/everwide1982/article/details/109138525
"""
小学奥数 7834 分成互质组
http://noi.openjudge.cn/math/7834/
信息学奥赛一本通(1221:分成互质组)
https://blog.csdn.net/lvcheng0309/article/details/118118800
https://blog.csdn.net/everwide1982/article/details/109138525
"""
import sys
import math
a=[]
vis=[]
N = 15
"""
for i in range ( N +1) :
a.append(0)
"""
for i in range ( N +1) :
vis.append(0)
cnt=0
def gcd( a,b):
if a%b==0:
return b
else:
return gcd(b,a%b)
n=int(input())
a = list(map(int,input().split()))
#print(a)
"""
for i in range(n):
a[i]=int(input())
"""
for i in range(n):
if vis[i]==0:
vis[i]=1
cnt+=1
for j in range(i+1,n):
if vis[j]==0 and gcd(a[i],a[j])==1:
a[i]*=a[j]
vis[j]=1
print(cnt)