#include<algorithm>

 #include<iostream>

 #include<cstring>

 #include<cstdio>

 using namespace std;

 #define N 100010

 #define int long long

 int n,k,a[N],ans,Maxx;

 bool not_ok[N];

 #undef int

 int main()

 #define int long long

 {

     scanf("%lld%lld",&n,&k);

     for(int i=;i<=n;i++)

      scanf("%lld",&a[i]);

     sort(a+,a++n);

     for(int i=n;i>=;i--)

      if(!not_ok[i]){

          ans++;

          if(a[i]%k!=) continue;

          int l=,r=i-;

          while(l<r){

              int mid=(l+r)>>;

              if(a[mid]>=a[i]/k) r=mid;

              else l=mid+;

         }

         if(a[l]==a[i]/k) not_ok[l]=;

      }

     printf("%lld\n",ans);

     return ;

 }