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}.
'''def bSearch(a,x,n):
	low = 0
	high = n-1
	flag = False
	while(low <= high and flag == False):
		mid = (low+high)//2
		if(a[mid] == x):
			flag = True
		else:
			if(x < a[mid]):
				high = mid - 1
			else:
				low = mid + 1
	return flag

n,k = map(int,input().split())

a = list(map(int,input().split()))

s = []
m = 0
a = sorted(a)

for i in a:
	if(i % k != 0):
		s.append(i)
		m += 1
	elif(bSearch(s,i/k,m) == False):
		s.append(i)
		m += 1

print(m)
#print(s)'''

n,k = map(int,input().split())

a = list(map(int,input().split()))
a = sorted(a)
s = []
d = {}
m = 0

for i in a:
	if(i % k != 0):
		s.append(i)
		m += 1
		d[i] = 1
	elif((i//k) not in d):
		s.append(i)
		d[i] = 1
		m += 1

print(m)
#print(d)
#print(s)