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 Main{
	public static void main(String[] args) throws IOException{
		
		//debugOutput();
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		//Set<Long> set = new HashSet<Long>();
		Set<Long> set = new TreeSet<Long>();
		int n, k;
		String[] nk = br.readLine().split(" ");
		n = Integer.parseInt(nk[0]);
		k = Integer.parseInt(nk[1]);
		
		boolean debug = k == 999999999 && n == 100000;
		debug = false;
		if(debug) System.out.println("A");

		int[] a = new int[n];
		String[] numbers = br.readLine().split(" ");
		if(debug) System.out.println("A");
		for(int i = 0; i < n; i++){
			a[i] = Integer.parseInt(numbers[i]);
			set.add((long)a[i]);
		}
		if(debug) System.out.println("A");
		Arrays.sort(a);
		if(debug) System.out.println("A");
		
		int ans = 0;
		for(int i = 0; i < n; i++){
			if(!set.contains((long)a[i])) continue;
			ans++;
			set.remove((long)a[i] * k);
		}
		out.println(ans);
		out.close();
	}
	
	public static void debugOutput() throws IOException{
		int n = 50000;
		int k = 999999999;
		Random random = new Random();
		PrintWriter out = new PrintWriter(new FileWriter("./debug"));
		

		out.println(n + " " + k);
		for(int i = 0; i < n; i++){
			out.print(random.nextInt(k) + 1 + " ");
		}
		out.println("");
		out.close();
		
		System.out.println("OK");
	}
}
		











