#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <queue>
#include <string>
#include <iomanip>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <stack>
#include <random>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include <assert.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll=long long;
#define read(x) cin>>(x);
#define readll(x) ll (x);cin>>(x);
#define readS(x) string (x);cin>>(x);
#define readvll(x,N) vector<ll> (x)((N));for(int i=0;i<(N);i++){cin>>(x)[i];}
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define rep2d(i,j,H,W) for(ll (i)=0;(i)<(H);(i)++)for(ll (j)=0;(j)<(W);j++)
#define is_in(x,y) (0<=(x) && (x)<H && 0<=(y) && (y)<W)
#define yn {cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}

int main(){
  ll N,M;
  cin>>N>>M;
  vector<ll> A(N);
  rep(i,M){
    ll a;
    cin>>a;
    A[a-1]++;
  }
  ll ans=0;
  for(ll i=N-1;i>=0;i--){
    if(A[i]==1){
      //cerr<<"%:"<<i+1<<endl;
      for(ll j=1;j*j<=i+1;j++){
        if((i+1)%j==0){
          //cerr<<j<<endl;
          A[j-1]=1-A[j-1];
          if((i+1)/j!=j){
            A[(i+1)/j-1]=1-A[(i+1)/j-1];
          }
        }
      }
    }else{
      //cerr<<"!:"<<i+1<<endl;
      ans++;
    }
  }
  cout<<ans<<endl;
  return 0;
}