from math import *

def Sieve(n):
    lst = [True] * (n + 1)
    S = set()
    for i in range(2, ceil(sqrt(n)) + 1):
        if lst[i]:
            for j in range(2 * i, n + 1, i):
                lst[j] = False
    for i in range(2, n + 1):
        if lst[i]:
            S.add(i)
    return S


M = int(input())
N = int(input())
C = list(map(int, input().split()))

S = Sieve(10050)

inf = 10 ** 18
pre = [-inf] * (M + 1)
pre[0] = 0
for i in range(N):
    dp = [-inf] * (M + 1)
    for m in range(M + 1):
        dp[m] = pre[m]
        
    for m in range(M + 1):
        if m - C[i] >= 0:
            dp[m] = max(dp[m], dp[m - C[i]] + 1)
            
    dp, pre = pre, dp
    
ans = 0
for m in range(M + 1):
    if M - m in S and pre[m] > 0:
        ans += pre[m]
        
print(ans + M//min(C))