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}.
'''input
10 2
1 2 3 4 5 6 7 8 9 10
'''
# practicing a skill right after sleep improves it a lot quickly
from sys import stdin, setrecursionlimit
import collections


# main starts
n, k = list(map(int, stdin.readline().split()))
if k == 1:
	print(n)
	exit()
myset = list(map(int, stdin.readline().split()))
myset.sort()
myset = set(myset)
count = 0
can = dict()
for i in myset:
	can[i] = True
for i in myset:
	if i * k in myset and can[i] == True:
		count += 1
		can[i * k] = False
print(n - count)