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
# sys.stdin=open("input.in",'r')
# sys.stdout=open("ou.out",'w')
n=int(input())
a=list(map(int,input().split()))
s=set(a)
x=len(s)
if n%2==0:
	if x>(n//2):
		print("YES")
	else:
		print("NO")
else:
	if x>=(n//2):
		print("YES")
	else:
		print("NO")
		