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()))
a = []

m = max(x , key = x.count)
d1 = []
d2 = []

for i in x :
    if i == m :
        d1.append(i)
    else:
        d2.append(i)

#print(d1)
#print(d2)

if len(d1) - 1 == len(d2) :
    print('YES')
    exit()
else:
    print('NO')
    exit()



