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 math
n=int(input())
a=sorted(list(map(int,input().split())))
ans=[]
count=1
for i in range(0,len(a)-1):
    if a[i]==a[i+1]:
        count+=1
    else:
        ans.append(count)
        count=1
ans.append(count)
if n==1:
    print("YES")
elif max(ans)>math.ceil(n/2):
    print("NO")
else:
    print("YES")