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())
arr = list(map(int, input().split()))
d = {}
for i in arr:
    d.setdefault(i, [0])[0] += 1

if len(arr) % 2 == 0:
    cond = len(arr) // 2 + 1
else:
    cond = len(arr) // 2 + 2
for i in d:
    if d[i][0] >= cond:
        print("NO")
        break
else:
    print("YES")
