from itertools import chain, product


def prime_set(N):
    """
    Nまでの素数のsetを返す
    """
    if N < 4:
        return ({}, {}, {2}, {2, 3})[N]
    Nsq = int(N ** 0.5 + 0.5) + 1
    primes = {2, 3} | set(chain(range(5, N + 1, 6), range(7, N + 1, 6)))
    for i in range(5, Nsq, 2):
        if i in primes:
            primes -= set(range(i * i, N + 1, i * 2))
    return primes


M = int(input())
N = int(input())
C = list(map(int, input().split()))
prime = prime_set(M+10)

dp = [-1] * (M + 1)
dp[0] = 0
for c in C:
    for i in range(M):
        if dp[i] == -1:
            continue
        if i + c <= M:
            dp[i + c] = max(dp[i + c], dp[i] + 1)

ans = 0
for cost, buy in enumerate(dp):
    if buy == -1:
        continue
    if M - cost in prime:
        ans += buy
ans += M // min(C)
print(ans)