#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

int m, n, c[20], can[30000];
bool prime(int x){
	if(x <= 1) return 0;
	for(int i = 2; i * i <= x; i++) if(x % i == 0 && x != i) return 0;
	return 1;
}
int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	
	cin >> m >> n;
	rep(i, n) cin >> c[i];
	memset(can, -1, sizeof(can));
	can[0] = 0;
	rep(i, n) for(int j = 0; j <= 20000; j++) if(can[j] >= 0) can[j + c[i]] = max(can[j + c[i]], can[j] + 1);
	
	int ans = 0, mx = 0;
	for(int i = 1; i <= m; i++){
		if(can[i] > 0 && prime(m - i)) ans += can[i];
		if(can[i] > 0) mx = max(mx, can[i]);
	}
	cout << ans + mx << endl;
	
	return 0;
}