import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

def main():
    N,M = map(int,input().split())
    A = list(map(int,input().split()))
    #0:閉, 1:開
    state = [0]*(N+1)
    for a in A:
        state[a] = 1
    ideal = [0]*(N+1)
    for v in range(1,N+1):
        L = make_divisors(v)
        for p in L:
            ideal[p] ^= 1
    
    ans = 0
    for v in reversed(range(1,N+1)):
        L = make_divisors(v)
        if state[v] != ideal[v]:
            #さぼった
            ans += 1
            for p in L:
                ideal[p] ^= 1
        else:
            for p in L:
                ideal[p] ^= 1
                state[p] ^= 1
        #print("idea",ideal)
        #print("now",state)
    print(ans)

        



if __name__ == '__main__':
    main()