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.OutputStream;

import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;


public class freeset {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        try (PrintWriter out = new PrintWriter(outputStream)) {
            prob solver = new prob();
            solver.solve(1, in, out);
        }
    }

    static class prob {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.ni();
            int k = in.ni();
            Integer[] arr = new Integer[n];
            for (int i = 0; i < n; ++i)
                arr[i] = in.ni();
            Arrays.sort(arr);
            HashSet<Integer> ans = new HashSet<>();
            for (int i = 0; i < n; ++i) {
                if (arr[i] % k != 0)
                    ans.add(arr[i]);
                else {
                    int get = arr[i] / k;
                    if (!ans.contains(get))
                        ans.add(arr[i]);
                }
            }
            out.println(ans.size());
        }

    }

    static class InputReader {
        BufferedReader buffer;
        StringTokenizer str;

        public InputReader(InputStream is) {
            buffer = new BufferedReader(new InputStreamReader(is));
        }

        public String n() {
            while (str == null || !str.hasMoreElements()) {
                try {
                    str = new StringTokenizer(buffer.readLine());
                } catch (IOException e) {
                }
            }
            return str.nextToken();
        }

        public int ni() {
            return Integer.parseInt(n());
        }

    }
}
 		 	  								 						 			  	