#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long double PI = 3.14159265;
long long int powerWithMod(long long int base, long long int exponent,
                           long long int modulus = LLONG_MAX) {
  long long int result = 1;
  base %= modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % modulus;
    exponent >>= 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long int modInverse(long long int a, long long int m = MOD) {
  return powerWithMod(a, m - 2, m);
}
int n, k, x;
set<long long int> a;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  if (k == 1) {
    cout << n << "\n";
    return 0;
  }
  while (n--) {
    cin >> x;
    a.insert(x);
  }
  for (auto& x : a) {
    if (a.find(k * x) != a.end()) a.erase(k * x);
  }
  cout << a.size() << "\n";
  return 0;
}
