#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const int oo = (int)1e9;
const double PI = 2 * acos(0.0);
const double eps = 1e-7;
const int MAXN = 1e5 + 10;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
int main() {
  int n, k, a[100009];
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  set<long long> s;
  for (int i = n - 1; i >= 0; i--)
    if (s.find((long long)k * a[i]) == s.end()) s.insert(a[i]);
  cout << ((int)((s).size())) << endl;
}
