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())
arr = list(map(int, input().split()))
counts=  [0]*1001

for x in arr:
	counts[x]+=1

mx = index = 0
for i in range(len(counts)):
	if(counts[i] > mx):
		mx = counts[i]
		index = i
su = 0
for i in range(len(counts)):
	if(i != index):
		su+=counts[i]

if(su >= counts[index]-1):
	print("YES")
else:
	print("NO")