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.io.* ;
import java.util.* ;

public class Solution{
	
	static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main (String[] args)
    {
        FastReader sc = new FastReader();
        int n = sc.nextInt();
        Long k = sc.nextLong();
        Long[] arr = new Long[n];
        int count=0;
    
        for(int i=0;i<n;i++){
            arr[i] = sc.nextLong();
        }
        
        if(k==1)
        {
            System.out.println(n);
            return ;
        }
    
        Arrays.sort(arr);
        ArrayList<Long> list = new ArrayList<Long>(Arrays.asList(arr));
        
        /*for(Long a:list)
            System.out.print(a+" ");
        System.out.println("");
        */
    
        while(list.size()!=0){
            Long c = list.get(list.size()-1);
            //System.out.println("for this c="+c);
            if(c%k==0){
                Long div = c/k;
                int a = Collections.binarySearch(list, div);
                //System.out.println("c="+c+" div="+div+" a="+a);
                if(a>=0){
                    list.remove(a);
                }
            }
            list.remove(list.size()-1);
            count++;
        }
        
        
        System.out.println(count);
    }

}