#include <iostream>
#include<set>
#include<algorithm>
#include<vector>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    int n,k;
    cin>>n>>k;
    vector<int> a(n);
    for(int i =0; i<n; ++i) cin>>a[i];
    sort(a.begin(),a.end());
    set<int> used;
    for(int i = 0; i<n; ++i)
        if(a[i]%k!=0 || !used.count(a[i]/k))
            used.insert(a[i]);
    cout << used.size();

}