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 A274 {
	
	class InputReader {

		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream));
			tokenizer = null;
		}

		public InputReader() throws FileNotFoundException {
			reader = new BufferedReader(new FileReader("d:/input.txt"));
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

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

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

	}
	
	public void run(){
		
		InputReader reader = new InputReader(System.in);
		int n , m;
		n = reader.nextInt();
		m = reader.nextInt();
		TreeSet<Long> set = new TreeSet<Long>();
		long a[] = new long[n];
		for(int i = 0 ; i < n ; i ++){
			a[i] = reader.nextLong();
			set.add(a[i]);
		}
		Arrays.sort(a);
		int cnt = 0;
		int ans = 0;
		for(int i = 0 ; i < n ; i ++){
			cnt = 0;
			long tmp = a[i];
			while(set.contains(tmp)){
				cnt ++;
				set.remove(tmp);
				tmp *= m;
			}
			if(cnt != 0){
				ans += cnt/2;
				if(cnt %2 == 1) ans ++;
			}
		}
		System.out.println(ans);
		
	}
	
	public static void main(String[] args) {
		new A274().run();
	}

}
