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.*;
import java.math.BigInteger;
/*
8 6

46
 */
public class b
{
	public static void main(String[] arg) throws Exception
	{
		new b();
	}
	int n, k;
	long[] memo;
	ArrayList<Long> vs;
	long solve(int idx)
	{
		if(idx == n) return 0;
		long ret = memo[idx];
		if(ret != -1) return ret;
		ret = 0;
		ret = Math.max(ret, solve(idx+1));
		if(idx+1 < n && vs.get(idx)*k == vs.get(idx+1)) ret = Math.max(ret, solve(idx+2)+1);
		else ret = Math.max(ret, solve(idx+1)+1);
		return memo[idx] = ret;
	}
	public b() throws Exception
	{
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		n = in.nextInt();
		k = in.nextInt();
		TreeSet<Long> ts = new TreeSet<Long>();
		for(int i = 0; i < n; i++) ts.add(in.nextLong());
		vs = new ArrayList<Long>();
		while(ts.size() > 0)
		{
			long v = ts.first();
			ts.remove(v);
			vs.add(v);
			while(ts.contains(k*v))
			{
				v *= k;
				ts.remove(v);
				vs.add(v);
			}
		}
		memo = new long[n];
		Arrays.fill(memo, -1);
		System.out.println(solve(0));
		in.close(); out.close();
	}
	class FastScanner
	{
		BufferedReader br;
		StringTokenizer st;
		public FastScanner(InputStream in)
		{
			br = new BufferedReader(new InputStreamReader(in));
			st = new StringTokenizer("");
		}
		public String next() throws IOException
		{
			while(!st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int nextInt() throws IOException
		{
			return Integer.parseInt(next());
		}
		public void close() throws IOException
		{
			br.close();
		}
		public long nextLong() throws IOException
		{
			return Long.parseLong(next());
		}
		public double nextDouble() throws IOException
		{
			return Double.parseDouble(next());
		}
	}
}