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=input().split()
l=[]
d={}
for i in range(len(inp)):
    l.append(int(inp[i]))
    if(l[i] not in d):
        d[l[i]]=1
    else:
        d[l[i]]=d.get(l[i])+1
gmax=-1
val=-1
for num in d:
    if(gmax<d.get(num)):
        gmax=d.get(num)
        val=num
count=0        
for num in d:
    if(val!=num):
        count=count+d.get(num)
        
if(count>=(gmax-1)):
    print('YES')
else:
    print('NO')