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.
def yar(dict,n):
	for e in dict.keys():
		if(dict.get(e)>(n+1)//2):
			return "NO"
	return "YES"

n=int(input())
L=list(map(int,input().split()))
dict={}
for i in range(0,len(L)):
	if L[i]  not in dict.keys():
		dict[L[i]]=1
	else:
		dict[L[i]]+=1
print(yar(dict,n))
