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 ceil
n = int(input())
nums = list(input().split())
counts = {}
for i in range(n):
    if nums[i] not in counts:
        counts[nums[i]] = 0
    counts[nums[i]] += 1

maxcount = 0
for key in counts:
    if counts[key] > maxcount:
        maxcount = counts[key]
    
if maxcount <= ceil(n/2):
    print("YES")
else:
    print("NO")