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 < 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.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 105, 1 ≤ k ≤ 109). The next line contains a list of n distinct positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).

All the numbers in the lines are separated by single spaces.

Output

On the only line of the output print the size of the largest k-multiple free subset of {a1, a2, ..., an}.

Examples

Input

6 2
2 3 6 5 4 10


Output

3

Note

In the sample input one of the possible maximum 2-multiple free subsets is {4, 5, 6}.
line = raw_input().split()
n = int(line[0])
k = int(line[1])

a = []
line = raw_input().split()
for i in range(n):
    a.append(int(line[i]))

a.sort()
mark = [True for i in range(n)]

"""
j = 0
for i in range(n):
    if mark[i]:
        while j < n and a[j] < a[i] * k:
            j += 1
        if j == i or j >= n or a[j] > a[i] * k:
            continue
        mark[j] = False
"""

for i in range(n - 1):
    if mark[i]:
        l = i + 1
        r = n - 1
        while l < r:
            t = (l + r) // 2
            if a[t] < a[i] * k:
                l = t + 1
            else:
                r = t
        if a[r] == a[i] * k:
            mark[r] = False

ans = 0
for i in range(n):
    if mark[i]:
        ans += 1

print ans
