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())
a = list(map(int, input().rstrip().split()))
d = dict()
for x in a:
    if x not in d:
        d[x] = 1
    else:
        d[x] += 1
maxm = 0
no = 0
for x in d:
    if d[x] > maxm:
        maxm = d[x]
        no = 1
    elif d[x] == maxm:
        no += 1
if no > 1:
    max_2 = maxm
else:
    max_2 = 0
    for x in d:
        if d[x] > max_2 and d[x] < maxm:
            max_2 = d[x]
# print(d)
# print(maxm, max_2)

if maxm - max_2 > 1:
    print("NO")
else:
    print("YES")