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.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;

import javax.management.Query;

public class jjejsd {
	public static void main (String[] args) throws NumberFormatException, IOException {
		BufferedReader  br= new BufferedReader(new InputStreamReader( System.in));
		Scanner sc=new Scanner(System.in);
		//StringTokenizer st=new StringTokenizer(br.readLine());
		//int a=Integer.parseInt(st.nextToken());
		int n=sc.nextInt();
		long k=sc.nextLong();
		HashSet<Long> h = new HashSet<>();
		Integer[]x=new Integer[n];
		for(int i=0;i<n;i++) {
			x[i]=sc.nextInt();
		}
		Arrays.sort(x);
		int c=0;
		for(int i=n-1;i>=0;i--) {
			long d=x[i]*k;
			if(!h.contains(d)) {
				h.add((long)x[i]);
				c++;
			}
		}
		System.out.println(c);
	}
}

