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.
import sys
from math import*
input=sys.stdin.buffer.readline

n=int(input())
arr=list(map(int,input().split()))
arr.sort()
#print(arr)
mc=0
count=0
for i in range(n-1):
	if arr[i]==arr[i+1]:
		count+=1
	else:
		if mc<count:
			mc=count
		count=0
#print(mc)
if mc<count:
	mc=count
if int(ceil(n/2))>=mc:
	print("YES")
else:
	print("NO")
					#unknown_2433