#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long A[100001], B[100001];
bool C[100001];
int bb(long long a) {
  int i = 0, f = n, m;
  while (f - i > 1) {
    m = (i + f) / 2;
    if (A[m] <= a)
      i = m;
    else
      f = m;
  }
  return i;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  if (k == 1) {
    set<int> S;
    for (int i = 0; i < n; i++) {
      S.insert(A[i]);
    }
    cout << S.size() << endl;
    return 0;
  }
  sort(&A[0], &A[0] + n);
  for (int i = 0; i < n; i++) {
    int pos = bb(A[i] * k);
    if (A[pos] == A[i] * k) {
      C[i] = true;
      B[pos] = B[i] + 1;
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (C[i] == false) {
      ans += (B[i] + 2) / 2;
    }
  }
  cout << ans << endl;
  return 0;
}
