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()))
lol = {}
counter = {}
arr.sort()

for x in arr:
	if x in counter:
		counter[x] += 1
	else:
		counter[x] = 1

ans = 0
for i in range(len(arr)):
	if arr[i] in lol:
		continue
	lol[arr[i]] = 1
	cur = arr[i]
	a, b = 0, 0
	turn = 0
	while cur <= 1000000000:
		lol[cur] = 1
		if turn % 2 == 0:
			if cur in counter:
				a += counter[cur]
		else:
			if cur in counter:
				b += counter[cur]
		turn += 1
		cur = cur * k
	ans += max(a, b)
print(ans)