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.
n,k= map(int,input().split())
arr= list(map(int,input().split()))
arr.sort()
visited=[0]*n
i=0
group_2 = []
group_1 = []
while i<n:
    if visited[i]==0:
        group_1.append(arr[i])
        visited[i]=1
        x = arr[i]*k
        left=i
        right = n-1
        while left<=right:
            mid = left+(right-left)//2
            if arr[mid]==x:
                visited[mid]=1
                group_2.append(arr[mid])
                break
            elif arr[mid]<x:
                left=mid+1
            else:
                right=mid-1
        i+=1
    else:
        i+=1
print (max(len(group_1),len(group_2)))
