import sys,random,bisect
from collections import deque,defaultdict
import heapq
from itertools import permutations
from math import gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N,M = mi()
A = li()

door = [0] * (N+1)
for a in A:
    door[a] = 1

erai = [0] * (N+1)
for i in range(1,N+1)[::-1]:
    check = 0
    for j in range(2*i,N+1,i):
        if erai[j]:
            check ^= 1
    erai[i] = door[i]^check

print(N-sum(erai))