Yaroslav has an array that consists of *n* integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time.

Help Yaroslav.
The first line contains integer *n* (1 ≤ *n* ≤ 100) — the number of elements in the array. The second line contains *n* 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> ≤ 1000) — the array elements.
n=int(input())

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

if n==1:
	print("YES")
elif n!=1 and len(set(a))==1:
	print("NO")
else:
	d={}
	for i in a:
		if i in d:
			d[i]+=1
		else:
			d[i]=1

	counts = list( d.values() )
	counts.sort()
	s=counts[-2]
	r = counts[-1]-counts[-2]

	if ((n-r-1)+2)-s*2 >= r:
		print("YES")
	else:
		print("NO")