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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;


public class Main {


    
    public static void main(String[] args) throws NumberFormatException, IOException {
        

        
                
    BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
    PrintWriter pr=new PrintWriter(System.out);


   

StringTokenizer str =new StringTokenizer(r.readLine());
int n=Integer.parseInt(str.nextToken());
long k=Integer.parseInt(str.nextToken());
if(k==1)
{
    pr.println(n);
    pr.flush();
    pr.close();
    return;
}
long arr[]=new long[n];
str =new StringTokenizer(r.readLine());
for(int i=0;i<n;i++)
{
    
    arr[i]=(Integer.parseInt(str.nextToken()));
    
}

Arrays.sort(arr);
long max=arr[n-1];
int count=0;
int start=1;
for(int i=0;i<n;i++)
{
    if(arr[i]>-1&&arr[i]*k<=max)
    for(int j=start;j<n;j++)
    {
        long x=arr[i]*k;
        
        if(x==arr[j])
        {
            start=j;
            arr[j]=-1;
            count++;
            break;
            
        }
        if(x<arr[j])
        {
            start=j-1;
            break;
            
        }
    }
    
}


pr.println(n-count);


pr.flush();
pr.close();

    }
}