T=int(input())
N=int(input())
time=[int(input()) for i in range(N)]
inf=1<<30
dp=[inf]*(1<<N)
dp[0]=0
sum_time=[sum(time[i] for i in range(N)if bit&1<<i) for bit in range(1<<N)]
for bit in range(1<<N):
    subset=bit
    while subset:
        if sum_time[subset]<=T:
            dp[bit]=min(dp[bit],dp[bit^subset]+1)
        subset-=1
        subset&=bit
ans=dp[-1]
print(ans)