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

public class Main {

	BufferedReader in;
	StringTokenizer str = null;
	
	private String next() throws Exception{
		if (str == null || !str.hasMoreElements())
			str = new StringTokenizer(in.readLine());
		return str.nextToken();
	}
	
	private int nextInt() throws Exception{
		return Integer.parseInt(next());
	}
	
	private long nextLong() throws Exception{
		return Long.parseLong(next());
	}
	
	private double nextDouble() throws Exception{
		return Double.parseDouble(next());
	}
	
	public void run() throws Exception{
		in = new BufferedReader(new InputStreamReader(System.in));
		int n = nextInt();
		int k = nextInt();
		int a[] = new int[n];
		for(int i=0;i<n;i++) a[i] = nextInt();
		Arrays.sort(a);
		
		int ret[] = new int[n];
		int size = 0;
		for(int i=0;i<n;i++){
			if (a[i] % k != 0){
				ret[size++] = a[i];
			}else{
				int t = a[i]/k;
				int l = -1;
				int r = size;
				while(r - l > 1){
					int mid = (r+l)/2;
					if (ret[mid] >= t) {
						r = mid;
					}else{
						l = mid;
					}
				}
				if (!(r < size && ret[r] == t)){
					ret[size++] = a[i];
				}
			}
		}
		System.out.println(size);
	}
		
	public static void main(String[] args) throws Exception{
		new Main().run();
	}
}