#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
bool valid(int x, int y) { return x >= 0 && y >= 0 && x < 3 && y < 3 ? 1 : 0; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  long long arr[n];
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  int ans = 0;
  bool vis[n + 5];
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < n; ++i) {
    if (!vis[i]) {
      ++ans;
      vis[i] = 1;
      if (binary_search(arr, arr + n, arr[i] * k)) {
        int x = lower_bound(arr, arr + n, arr[i] * k) - arr;
        vis[x] = 1;
      }
    }
  }
  cout << ans;
  return 0;
}
