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.*;
import java.util.*;

/**
 *
 * @coder Altynbek Nurgaziyev
 */
public class C274A {

        String fileName = "";

        void solution() throws Exception {
                int n = in.nextInt();
                int k = in.nextInt();
                Integer[] arr = new Integer[n];
                for (int i = 0; i < n; i++) {
                        arr[i] = in.nextInt();
                }
                Arrays.sort(arr);
                TreeSet<Integer> set = new TreeSet<>();
                int counter = 0;
                for (int i = n - 1; i >= 0; i--) {
                        if (!set.contains(arr[i])) {
                                if (arr[i] % k == 0) {
                                        set.add(arr[i] / k);
                                }
                                counter++;
                        }
                }
                out.println(counter);
        }

        public static void main(String[] args) throws Exception {
                new C274A().run();
        }

        Scanner in;
        PrintWriter out;

        void run() throws Exception {
                if (fileName.equals("")) {
                        in = new Scanner(new InputStreamReader(System.in));
                        out = new PrintWriter(new OutputStreamWriter(System.out));
                } else {
                        in = new Scanner(new File(fileName + ".in"));
                        out = new PrintWriter(new File(fileName + ".out"));
                }
                solution();
                out.flush();
        }

        class Scanner {

                final BufferedReader br;
                StringTokenizer st;

                Scanner(InputStreamReader stream) {
                        br = new BufferedReader(stream);
                }

                Scanner(File file) throws Exception {
                        br = new BufferedReader(new FileReader(file));
                }

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

                Integer nextInt() throws Exception {
                        return Integer.parseInt(next());
                }

                Long nextLong() throws Exception {
                        return Long.parseLong(next());
                }

                Double nextDouble() throws Exception {
                        return Double.parseDouble(next());
                }
        }
}
