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.
x = int(input())
a = list(map(int,input().split()))
r = list(set(a))
k = 0
if x%2 == 1:
	t = x//2+1
else:
	t = x//2

for i in range(len(r)):
	r1 = a.count(r[i])
	if r1 > t:
		print("NO")
		k = 1
		break
if k == 0:
	print("YES")