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.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class C168 {

    public void solve() throws IOException {

        Scanner sc = new Scanner(System.in);
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);


        int i = 0, j = 0;
        long ans = 0, sum = 0, count = 0;
        String s[] = sc.nextLine().split(" ");
        int n = Integer.parseInt(s[0]);
        long k = Long.parseLong(s[1]);

        
       //ArrayList<Long> list = new ArrayList<Long>();
        TreeSet<Long> set = new TreeSet<Long>();
        s = sc.nextLine().split(" ");
        for (i = 0; i < n; ++i) {
            // list.add(Long.parseLong(s[i]));
            set.add(Long.parseLong(s[i]));
        }

        count = 0;
        while (!set.isEmpty()) {
            // long b = list.get(0);
            long bb = set.pollFirst();

            if (set.contains(bb * k)) {
                set.remove(bb * k);
            }
            // set.remove(bb);
            count++;
        }
        System.out.println(count);
    }

    public static void main(String[] args) throws IOException {
        new C168().solve();
        ///System.out.println(1000000000l*1000000000);
    }
}
