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())
inp = list(map(int,input().split()))
from collections import Counter
c=Counter(inp)
d=list(c.values())
d.sort()
a=0
for i in range(len(d)-1):
    d[i+1]=d[i+1]-d[i]
    if(i!=len(d)-2):
        a+=2*d[i]
if(d[len(d)-1]>1+a):
    print ("NO")
else:
    print ('YES')