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}.
// CodeForces Round #274 A competition

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class KMultFreeSet {

	int n;
	long k;
	long []a;
	int maxSubs;

	private void readData(BufferedReader bin) throws IOException {
		String s = bin.readLine();
		String []ss = s.split(" ");
		n = Integer.parseInt(ss[0]);
		k = Integer.parseInt(ss[1]);
		// read a
		a = new long[n];
		s = bin.readLine();
		ss = s.split(" ");
		for (int i=0; i<n; i++) {
			a[i] = Integer.parseInt(ss[i]);
		}
	}

	void printRes() {
		System.out.println(maxSubs);
	}	
	
	

	private void calculate() {
		Arrays.sort(a);
		boolean []used = new boolean[n];
		maxSubs = n;
		for (int i=0; i<n; i++) {
			if (used[i]) {
				continue;
			}
			used[i]=true;
			int ii = i;
			long ai = a[ii];
			int ng = 1;  // number elements in k group
			while (ii<n) {
				int f = Arrays.binarySearch(a, ii+1, n, (k*ai));
				if (f>=0) {
					ng++;
					used[f] = true;
					ii = f;
					ai = a[ii];					
				} else {
					break;
				}				
			}
			if (ng>1) {
				maxSubs -= (ng/2);
			}			
		}		
	}

	public static void main(String[] args) throws IOException {
		// BufferedReader bin = new BufferedReader(new FileReader("cactus.in"));
		BufferedReader bin = new BufferedReader(
				new InputStreamReader(System.in));
		KMultFreeSet l = new KMultFreeSet();
		l.readData(bin);
		l.calculate();
		l.printRes();
	}
}
