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.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Locale;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class CF275C {

	BufferedReader in;
	StringTokenizer st;
	PrintWriter out;

	String next() throws IOException {
		while (st == null || !st.hasMoreTokens())
			st = new StringTokenizer(in.readLine());
		return st.nextToken();
	}

	int nextInt() throws Exception {
		return Integer.parseInt(next());
	}

	long nextLong() throws Exception {
		return Long.parseLong(next());
	}

	double nextDouble() throws Exception {
		return Double.parseDouble(next());
	}

	TreeSet<Integer> notadd, add, x;
	int k;

	void solve() throws Exception {
		int n = nextInt();
		k = nextInt();
		if (k == 1) {
			out.println(n);
			return;
		}
		int a[] = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = nextInt();
		x = new TreeSet<Integer>();
		for (int i = 0; i < n; i++)
			x.add(a[i]);
		add = new TreeSet<Integer>();
		notadd = new TreeSet<Integer>();

		int total = 0;
		for (int i = 0; i < n; i++)
			total += get(a[i]);
		out.println(total);
	}

	int get(int v) {
		if (v % k != 0)
			return 1;
		if (add.contains(v))
			return 1;
		if (notadd.contains(v))
			return 0;
		if (x.contains(v / k))
			return 1 - get(v / k);
		return 1;
	}

	void run() {
		try {
			Locale.setDefault(Locale.US);
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(new OutputStreamWriter(System.out));
			solve();
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

	public static void main(String[] args) {
		new CF275C().run();
	}

}
