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 sys
input = lambda: sys.stdin.readline().rstrip()

from collections import Counter

N,K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()

lib = {}
for i,a in enumerate(A):
    lib[str(a)] = i

seen = [0]*N
color = 1
for i,a in enumerate(A):
    if seen[i]:continue
    seen[i] = color
    
    key = str(a*K)
    while key in lib:
        j = lib[key]
        seen[j] = color
        key = str(int(key)*K)
    color+=1
    
C = Counter(seen)
ans = 0
for k,v in C.items():
    ans += (v-1)//2+1
print(ans)
        
        
    