#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using ll = long long;
using mint = atcoder::modint1000000007;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m;cin>>n>>m;
    vector<bool>flag(n+1);
    rep(i,m){
        int a;cin>>a;
        flag[a]=true;
    }
    int ans=0;
    rrep2(i,n+1,1){
        if(!flag[i])ans++;
        else{
            int x=i,y=1;
            while(y*y<x){
                if(x%y==0){
                    flag[y]=!flag[y];
                    flag[x/y]=!flag[x/y];
                }
                y++;
            }
            if(y*y==x){
                flag[y]=!flag[y];
            }
        }
    }
    cout<<ans<<"\n";
}