A k-multiple free set is a set of integers where there is no pair of integers where one is equal to another integer multiplied by k. That is, there are no two integers x and y (x < y) from the set, such that y = x·k.

You're given a set of n distinct positive integers. Your task is to find the size of it's largest k-multiple free subset.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 105, 1 ≤ k ≤ 109). The next line contains a list of n distinct positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).

All the numbers in the lines are separated by single spaces.

Output

On the only line of the output print the size of the largest k-multiple free subset of {a1, a2, ..., an}.

Examples

Input

6 2
2 3 6 5 4 10


Output

3

Note

In the sample input one of the possible maximum 2-multiple free subsets is {4, 5, 6}.
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void ri(T &i) {
  bool minus = false;
  char c;
  for (c = getchar(); (c < '0' || c > '9') && (c != '-'); c = getchar())
    ;
  if (c == '-') {
    minus = true;
    c = '0';
  }
  for (i = 0; c >= '0' && c <= '9'; c = getchar())
    i = (i << 3) + (i << 1) + (c - 48);
  if (minus) i = (~i) + 1;
}
int main() {
  int n;
  int k;
  cin >> n;
  cin >> k;
  vector<int> in;
  int t;
  for (int i = 0; i < n; i++) {
    ri(t);
    in.push_back(t);
  }
  sort(in.begin(), in.end());
  int cnt = 0;
  map<int, int> ss;
  for (int i = 0; i < n; i++) {
    int cur = in[i];
    if (cur % k == 0) {
      int tem = cur / k;
      if (ss[tem] == 1) {
      } else {
        ss[cur] = 1;
        cnt++;
      }
    } else {
      ss[cur] = 1;
      cnt++;
    }
  }
  cout << cnt << endl;
  return 0;
}
