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}.
/**
 * Created with IntelliJ IDEA.
 * User: yuantian
 * Date: 3/4/13
 * Time: 1:48 AM
 * To change this template use File | Settings | File Templates.
 */
import java.util.*;

public class K_MultipleFreeSet {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();

        if(k == 1) {
            System.out.println(n);
            return ;
        }

        long[] data = new long[n];
        for(int i = 0; i < n; i++) {
            data[i] = in.nextInt();
        }
        shuffle(data);
        Arrays.sort(data);
        boolean[] removed = new boolean[n];
        int j = 0, res = n;
        for(int i = 0; i < n; i++) {
            while(j < i && data[j] * k < data[i])
                j++;
            if(j < i && !removed[j] && data[j]*k == data[i]) {
                res--;
                removed[i] = true;
            }
        }

        System.out.println(res);
    }

    static void shuffle(long[] a)
    {
        int n=a.length;
        Random rnd = new Random(System.nanoTime());
        for (int i=0; i<n; ++i)
        {
            int v=rnd.nextInt(n-i);
            long tmp=a[i+v];
            a[i+v]=a[i];
            a[i]=tmp;
        }
    }
}
