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}.

import java.util.*;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Francisco
 */
public class Main {
    public static void main(String []ar){
        Scanner s = new Scanner (System.in);
//        Scanner s=new Scanner ("6 2\n2 3 6 5 4 10");
//        Scanner s=new Scanner ("10 2\n1 2 3 4 5 6 7 8 9 10");

        SortedSet a = new TreeSet();
        Set b = new TreeSet();
        int n,k;
        n=s.nextInt();
        k=s.nextInt();
        int aux;
        
        Object [] arr;
        int [] rta=new int[n];
        for (int i=0;i<n;i++){
            aux=s.nextInt();
            a.add(aux);
        }
        arr=a.toArray();
        if (k==1)
            System.out.println(n);
        else{
            for (int j=0;j<n;j++){
                aux=(int)arr[j];
                if ((aux%k)==0){
                    if (!esta(aux/k,b))
                        b.add(aux);
                }
                else
                        b.add(aux);
            }
            System.out.println(b.size());
        }
    }
    public static boolean esta(int a, Set b){
        return b.contains(a);
    }
}
