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())
l=[int(i) for i in input().split()]
l1=[0]*1000
for i in range(n):
    l1[l[i]-1]+=1
j=max(l1)
s=0
c=0
for i in range(1000):
    if(l1[i]==j and c==0):
        k=i
        c=1
        continue
    else:
        s+=l1[i]
if(l1[k]>=s+2):
    print("NO")
else:
    print("YES")