274_A. k-Multiple Free Set_33427
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}.
var inp = readline().split(' ').map(function(cur,i,ar){return parseInt(cur.trim());});
var n = inp[0], k = inp[1];
var a = {}, len = new Array(n);
inp = readline().split(' ').map(function(cur,i,ar){return parseInt(cur.trim());});
inp.sort(function(a,b){return a - b;});

for(var i = 0; i < n; i++) {
    a[inp[i]] = i;
    if(inp[i] % k == 0 && a[inp[i] / k] != undefined){
        var t = a[inp[i] / k];
        len[i] = len[t] + 1;
        len[t] = 0;
    } 
    else len[i] = 1; 
}
var ans = 0;
for(var i = 0; i < n; i++)
    ans += Math.floor((len[i] + 1) / 2);
print((k == 1)? n : ans);
