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.
from collections import Counter
n=int(input())
arr=list(map(int,input().split()))
arr=Counter(arr)
b=[]
for i in arr:
    b.append(arr[i])
b.sort(reverse=True)
for i in range(1,len(b)):
    b[0]-=b[i]
if b[0]<2:
    print("YES")
else: 
    print("NO")
    