#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>
#include <fstream>

using namespace std;
typedef long long ll;
using ull = unsigned long long;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353;
constexpr int MAX = 1100000;

int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int T; cin >> T;
	int n; cin >> n;
	vector<int> dp(1 << n, inf);
	vector<int> t(n); for (int i = 0; i < n; i++) cin >> t[i];
	for (int S = 0; S < (1 << n); S++) {
		int sm = 0;
		for (int i = 0; i < n; i++) if (S >> i & 1) sm += t[i];
		if (sm <= T) dp[S] = 1;
	}

	for (int S = 0; S < (1 << n); S++) {
		int F = ((1 << n) - 1) ^ S;
		for (int T = F; T > 0; T = (T - 1) & F) {
			chmin(dp[S | T], dp[S] + dp[T]);
		}
	}
	cout << dp[(1 << n) - 1] << endl;
}