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.awt.Adjustable;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Stack;
import java.util.StringTokenizer;

public class codeforcesreturn {
	static ArrayList<Integer>[] adjlist;
	static int[][] adjmatrix;
	static int[][] adjmatrix2;
	static boolean[] vis;
	static boolean[] intialvis;
	static boolean[] vis2;
	static int[] counter;
	static int V, E;
	static Stack<Integer> st;
	static ArrayList<Integer> arrylist;
	static boolean flag;
	static int[] dx = new int[] { 1, -1, 0, 0 };
	static int[] dy = new int[] { 0, 0, 1, -1 };
	static int[] Arr;
	static PrintWriter pw;

	static int bin(int k, int[] Arr) {
		int left = 1;
		int right = Arr.length;
		int mid;
		int ans = 1;
		while (left <= right) {
			mid = (left + right) / 2;
			if (check(k, mid, Arr)) {
				ans = mid;
				left = mid + 1;
			} else {
				right = mid - 1;
			}
		}
		return ans;
	}

	static boolean check(int k, int w, int[] Arr) {
		int n = Arr.length;
		HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
		int c = 0;
		for (int i = 0; i < w; i++) {
			c += hm.getOrDefault(Arr[i] * k, 0);
			if (Arr[i] % k == 0)
				c += hm.getOrDefault(Arr[i] / k, 0);
			hm.put(Arr[i], hm.getOrDefault(Arr[i], 0) + 1);
		}
		if (c == 0)
			return true;
		for (int i = 0; i < n - w ; i++) {
			// remove
			c -= hm.getOrDefault(Arr[i] * k, 0);
			if (Arr[i] % k == 0)
				c -= hm.getOrDefault(Arr[i] / k, 0);
			if(hm.get(Arr[i])==1)
				hm.remove(Arr[i]);
			else
				hm.put(Arr[i], hm.getOrDefault(Arr[i], 0) - 1);
			// add
			c += hm.getOrDefault(Arr[i+w] * k, 0);
			if (Arr[i+w] % k == 0)
				c += hm.getOrDefault(Arr[i+w] / k, 0);
			hm.put(Arr[i+w], hm.getOrDefault(Arr[i+w], 0) + 1);
			if (c == 0)
				return true;
		}
		return false;
	}

	public static void main(String[] args) throws IOException, InterruptedException {
		pw = new PrintWriter(System.out);
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k=sc.nextInt();
		Integer[]Arr=new Integer[n];
		HashSet<Integer>hs=new HashSet<Integer>();
		
		for(int i=0;i<n;i++){
			Arr[i]=sc.nextInt();
			hs.add(Arr[i]);
		}
		if(k==1){System.out.println(hs.size());return;}
		Arrays.sort(Arr);
		for(int i=0;i<n;i++){
			if(Arr[i]%k==0&&hs.contains(Arr[i]/k))
				hs.remove(Arr[i]);
			
		}
		System.out.println(hs.size());

	}

	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

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

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

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

		public String nextLine() throws IOException {
			return br.readLine();
		}

		public double nextDouble() throws IOException {
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if (x.charAt(0) == '-') {
				neg = true;
				start++;
			}
			for (int i = start; i < x.length(); i++)
				if (x.charAt(i) == '.') {
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				} else {
					sb.append(x.charAt(i));
					if (dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg ? -1 : 1);
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

	}

}
