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.HashSet;
import java.util.Set;

public class ProblemA {
	
	public static void main(String[] args) throws IOException {
		BufferedReader s = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		
		String[] data = s.readLine().split(" ");
		int n = Integer.valueOf(data[0]);
		int k = Integer.valueOf(data[1]);
		
		
		long[] a = new long[n];
		String[] ai = s.readLine().split(" ");
		for (int i = 0 ; i < n ; i++) {
			a[i] = Integer.valueOf(ai[i]);
		}
		for (int i = 0 ; i < n ; i++) {
			int tm = (int)(Math.random() * n);
			long tmp = a[tm];
			a[tm] = a[i];
			a[i] = tmp;
		}
		Arrays.sort(a);

		Set<Long> invalid = new HashSet<Long>();
		int cnt = 0;
		for (int i = 0 ; i < n ; i++) {
			if (!invalid.contains(a[i])) {
				cnt++;
				invalid.add(a[i] * k);
			}
		}
		out.println(cnt);
		out.flush();
	}


	public static void debug(Object... os){
		System.err.println(Arrays.deepToString(os));
	}
}