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 INT():
    return int(input())

def lis():
    return [int(x) for x in input().split()]
    
n = INT()
check = (n+2-1)//2
a = lis()
b = set(a)
flag=0
for i in b:
    if a.count(i)>check:
        flag=1
        break
if flag==0:
    print("YES")
else:
    print("NO")