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.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;


public class C {
	
	public static final long MAX = 1000000000L;
	
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		StringTokenizer tok1 = new StringTokenizer(br.readLine());
		final int n = Integer.parseInt(tok1.nextToken());
		final long k = Integer.parseInt(tok1.nextToken());
		
		StringTokenizer tok2 = new StringTokenizer(br.readLine());
		int[] array = new int[n];
		for(int i = 0; i < n; i++){
			array[i] = Integer.parseInt(tok2.nextToken());
		}
		
		int size = n;
		
		Arrays.sort(array);
		
		boolean[] skip = new boolean[n];
		for(int i = 0; i < n; i++){
			if(skip[i]){
				size--;
				continue;
			}
			
			long input = array[i];
			input *= k;
			if(input > MAX){
				continue;
			}
			
			
			final int pos = Arrays.binarySearch(array, (int)(input));
			if(pos >= 0 && !skip[pos]){
				skip[pos] = true;
			}
		}
		
		System.out.println(size);
	}
}
