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.
from collections import defaultdict

n,k=[int(i) for i in input().strip().split()]
l=[int(i) for i in input().strip().split()]
if(k==1):
    print(n)
else:
    l.sort()
    ndict=defaultdict(list)
    for x in l:
        i=x
        while(i%k==0):
            i=i/k
        ndict[i].append(x)
    ans=0
    for i in ndict.values():
        count=0
        while(count<len(i)):
            if(count==len(i)-1):
                ans+=1
                break
            if(i[count]*k!=i[count+1]):
                ans+=1
                count+=1
            else:
                ans+=1
                count+=2
    print(ans)