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.
from math import factorial

n = int(input())
arr = [int(x) for x in input().split(" ")]

map_n = {}

for num in arr:
    if num in map_n:
        map_n[num] += 1
    else:
        map_n[num] = 1

for num in map_n:
    if map_n[num] >= (n / 2) + 1:
        print("NO")
        exit(0)

print("YES")
