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.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class Round_168_C {

    public static void main(String[] args) throws IOException {

        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String Line = in.readLine();
        int n = Integer.parseInt(Line.split("\\s+")[0]);
        long k = Long.parseLong(Line.split("\\s+")[1]);
        Long[] arr = new Long[n];
        Line = in.readLine();
        if (k == 1) {
            System.out.println(n);
            return;
        }
        String[] temps = Line.split("\\s+");
        for (int i = 0; i < n; i++)
            arr[i] = Long.parseLong(temps[i]);
        TreeMap<Long, Integer> M = new TreeMap<Long, Integer>();
        for (int i = 0; i < n; i++) {
            M.put(arr[i], i);
        }
        int count = 0;
        boolean[] taken = new boolean[n];
        for (int i = 0; i < n; i++) {
            if (!taken[i]) {
                int minic = 1;
                taken[i] = true;

                for (long val = arr[i];;) {
                    val *= k;
                    Integer c = M.get(val);
                    if (c == null)
                        break;
                    taken[c] = true;
                    minic++;
                }
                for (long val = arr[i]; val % k == 0;) {
                    val /= k;
                    Integer c = M.get(val);
                    if (c == null)
                        break;
                    taken[c] = true;
                    minic++;
                }
                count += (minic + 1) / 2;

            }
        }
        System.out.println(count);

    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

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

        public String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
                return 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());
        }
    }

}
