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())
numbers = map(int, input().split())
result = {}
limit = round(N / 2)

possible = True
for i in numbers:
    r = result.get(i, 0)

    if r > limit:
        possible = False
        break

    result[i] = r + 1

for i in result.values():
    if (i > limit):
        possible = False
        break

if possible:
    print("YES")
else:
    print("NO")