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;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
const int ST = 100010;
const int ST1 = 1000010;
const long long MOD = 1000000007;
long long ABS(long long a) {
  if (a < 0)
    return a * (-1);
  else
    return a;
}
vector<int> mn;
vector<int> pol;
map<int, bool> bb;
int main() {
  int n, k;
  cin >> n >> k;
  int ans = 0;
  mn.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> mn[i];
  }
  sort(mn.begin(), mn.end());
  if (k == 1) {
    cout << n;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (mn[i] % k == 0) {
      int t = mn[i] / k;
      if (bb[t] != true) {
        ans++;
        bb[mn[i]] = true;
      }
    } else {
      ans++;
      bb[mn[i]] = true;
    }
  }
  cout << ans;
  return 0;
}
