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;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long countDivisor(long long n) {
  long long divisor = 0;
  for (long long i = 1; i * i <= n; i++) {
    if (i * i == n)
      divisor += 1;
    else if (n % i == 0)
      divisor += 2;
  }
  return divisor;
}
int fx[] = {+1, -1, +0, +0};
int fy[] = {+0, +0, +1, -1};
int main() {
  long long n, k;
  cin >> n >> k;
  long long a[n];
  map<long long, long long> mp;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    mp[a[i]] = 1;
  }
  long long x, ans = 0;
  sort(a, a + n);
  for (long long i = n - 1; i >= 0; i--) {
    if (a[i] % k != 0) continue;
    x = a[i] / k;
    if (a[i] == x) continue;
    if (mp[a[i]]) mp[x] = 0;
  }
  for (long long i = 0; i < n; i++) {
    if (mp[a[i]] == 1) {
      ans++;
    }
  }
  cout << ans;
  return 0;
}
