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}.
'''
Author:Fuad Ashraful Mehmet
University of Asia Pacific
Date:09 Feb 2020
'''



class K_Free:
    def __init__(self,n,k):
        self.n=n
        self.k=k
        self.fuad=list(map(int,input().split()))
        self.fuad.sort()
        self.ans=[]
        #print(n,k)
    def Solve(self):
        for x in self.fuad:
            if x%self.k:
                self.ans.append(x)
            else:
                if int(x/self.k) not in self.ans:
                    self.ans.append(x)
            
        
        return len(self.ans)

a,b=map(int,input().split())
obj=K_Free(a,b)

print(obj.Solve())
