import sys

def divisors_list(n):
    divisors = [1]
    if n != 1:
        divisors.append(n)
    i = 2
    while i * i <= n:
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n // i)
        i += 1
    return divisors


def main():
    n, m = map(int, input().split())
    idx = list(map(int, input().split()))
    B = [0] * (n + 1)
    for i in idx: B[i] = 1
    A = [0] * (n + 1)
    D = [[]]
    for i in range(1, n + 1):
        d = divisors_list(i)
        D.append(d)
        for j in d: A[j] ^= 1
    ans = 0
    for i in range(n, 0, -1):
        if A[i] != B[i]:
            ans += 1
            d = D[i]
            for j in d: A[j] ^= 1
    print(ans)


if __name__ == '__main__':
    main()