#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
const int maxn=100010;
int n,m,ans,a[maxn];

int main()
{
map<int,int> hash;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    cin>>a[i];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)
    if(!hash[a[i]])
    {
        hash[a[i]*m]=1;
        ans++;
    }
    cout<<ans;
    return 0;
}
/**************************************************************
	Problem: 1761
	User: admin
	Language: C++
	Result: Accepted
	Time:5 ms
	Memory:2472 kb
****************************************************************/