from sys import stdin

def Sieve(n): #n以下の素数全列挙(O(nloglogn)) retは素数が入ってる。divlisはその数字の素因数が一つ入ってる

    ret = []
    divlis = [-1] * (n+1) #何で割ったかのリスト(初期値は-1)
    
    flag = [True] * (n+1)
    flag[0] = False
    flag[1] = False

    ind = 2
    while ind <= n:

        if flag[ind]:
            ret.append(ind)

            ind2 = ind ** 2

            while ind2 <= n:
                flag[ind2] = False
                divlis[ind2] = ind
                ind2 += ind

        ind += 1

    return ret,divlis


# return Prime factorization dict of l,(l+1),...,(r-1)
# plis must include all primes under M**0.5 ( M=max(r**0.5 , r-l) )
# dict style: ret[18] = [2,3,3]
def primeFactorizationFactorial(l,r,plis):

    a = {}
    ret = {}
    for i in range(l,r):
        a[i] = i
        ret[i] = []
    
    for p in plis:
        if p**2 >= r:
            continue
        divfi = (l+p-1) // p * p
        for i in range(divfi,r,p):
            while a[i] % p == 0:
                a[i] //= p
                ret[i].append(p)
    for i in a:
        if a[i] != 1:
            ret[i].append(a[i])
    return ret



N,M = map(int,stdin.readline().split())

plis,_ = Sieve(N+10)
dic = primeFactorizationFactorial(1,N+10,plis)

#print (dic)

A = list(map(int,stdin.readline().split()))

lis = [0] * (N+1)
ANS = 0

for i in A:
    lis[i] = 1

for i in range(N,0,-1):

    if lis[i] == 1:

        d2 = {}
        for v in dic[i]:
            if v not in d2:
                d2[v] = 1
            else:
                d2[v] += 1

        lisA = [1]
        for p in d2:
            newlis = []
            wow = p
            for j in range(d2[p]):
                for k in lisA:
                    newlis.append(wow * k)
                wow *= p

            for j in newlis:
                lisA.append(j)

        for j in lisA:
            lis[j] ^= 1


    else:
        ANS += 1

print (ANS)