#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;

int main(){
    i64 L, N; cin >> L >> N;
    vector<i64> A(N); rep(i,N) cin >> A[i];

    vector<vector<int>> coins(60, vector<int>(60));
    for(i64 a : A){
        int p2 = 0; while(a%2 == 0){ p2++; a /= 2; }
        int p3 = 0; while(a%3 == 0){ p3++; a /= 3; }
        rep(s,2) rep(t,2) coins[p3+s][p2+t] ^= 1;
    }
    i64 sz = 1; while((sz+1)*(sz+1) <= L) sz++;
    vector<i64> Q(sz+1);
    rep(y,60) rep(x,60) if(coins[y][x]){
        i64 mp = i64(1)<<x; rep(i,y) mp *= 3;
        i64 smallL = L / mp;
        for(i64 i=1; i*i<=smallL; i++) if(i%2 != 0 && i%3 != 0){
            i64 f = smallL / (i * i);
            Q[i] += (f + 1) / 6;
            Q[i] += (f + 5) / 6;
        }
    }
    i64 ans = 0;
    
    vector<i64> sieve(sz+1, 1);
    sieve[0] = sieve[1] = 0;
    vector<i64> mobius(sz+1);
    mobius[1] = 1;
    for(i64 p=2; p<=sz; p++) if(sieve[p]){
        for(i64 q=p; p*q<=sz; q++) sieve[p*q] = 0;
        for(i64 q=sz/p; q>=1; q--) mobius[p*q] = -mobius[q];
    }
    for(i64 p=1; p<=sz; p++) ans += mobius[p] * Q[p];
    cout << ans << endl;

    return 0;
}