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
d=defaultdict(lambda: 0)

n,k=map(int,input().split())
x=list(map(int,input().split()))
c=0
f=True
for i in range(n):
    if k==1:
        # print(n)
        f=False
        break
    if d[x[n-i-1]]==2:
        continue
    if x[n-i-1]%k==0 and d[x[n-i-1]]==0:
        d[x[n-i-1]//k]=2
    if d[x[n-i-1]]==0:
        c+=1
        d[x[n-i-1]]=1


print(c if f else n)
# print(dict(d))