#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i=0;i<(int)(n);i++)

int main(){
  int n,m;
  cin>>n>>m;
  priority_queue<int> pq;
  rep(i,m){
    int a;
    cin>>a;
    pq.push(a);
  }
  int cn=0;
  while(!pq.empty()){
    int x=pq.top();
    pq.pop();
    if(!pq.empty()&&(x==pq.top())) {
      pq.pop();
      continue;
    }
    cn++;
    for(int i=2;i*i<=x;i++){
      if(x%i==0){
        pq.push(i);
        if(i!=x/i) pq.push(x/i);
      }
    }
    if(x!=1) pq.push(1);
  }
  cout<<n-cn<<endl;
}