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.
def perms(dic,n):
    for ele in dic:
        if dic[ele]> (n+1)//2:
            return 'NO'
    
    return 'YES'
n= int(input())
l= list(map(int, input().split()))
dic={}
for i in range(n):
    if l[i] not in dic:
        dic[l[i]]=1
    else:
        dic[l[i]]+=1

print(perms(dic, n))
