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.
import bisect
def binary_search(a,l):
    p = bisect.bisect_left(a,l)
    try:
        if a[p]==l:
            return True
        else:
            return False
    except:
        return False
n,k = map(int,input().split())
a = list(map(int,input().split()))
a = sorted(a)
i = 0
while True:
    if i==len(a):
        break
    if binary_search(a,2*a[i])==True:
        pos = bisect.bisect_left(a,2*a[i])
        del a[pos]
    i+=1
print(len(a))
