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()) 
x= list(map(int, input().split()))
d={}
ma = -1
su = 0
for i in range(len(x)):
    try:
        d[x[i]]+=1
        if(d[x[i]]>ma):
            ma = d[x[i]]
            vv = x[i]
    except:
        d[x[i]]=1
for i in range(len(x)):
    if(x[i]!=vv):
        su +=d[x[i]]
if(su >= (max-1)):
    print("YES")
else:
    print("NO")


    


    
        