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* &lt; *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.
The first line of the input contains two integers *n* and *k* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *k* ≤ 10<sup class="upper-index">9</sup>). The next line contains a list of *n* distinct positive integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).

All the numbers in the lines are separated by single spaces.
'''
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())
