t=int(input());n=int(input())
a=[int(input()) for i in range(n)]
dp=[1<<30]*(1<<n);dp[0]=0
dp2=[0]*(1<<n)
for i in range(1<<n):
    c=0
    for j in range(n):
        c+=(i>>j&1)*a[j]
    dp2[i]=c
m=(1<<n)-1
for i in range((1<<n)-1):
    c=0
    for j in range(n):
        if not i>>j&1:
            c=1<<j;break
    k=m-i;s=m-i
    while k:
        if k&c and dp2[k]<=t:
            dp[i|k]=min(dp[i|k],dp[i]+1)
        k=(k-1)&s
print(dp[-1])