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 = [int(i) for i in input().split()]

freq = {}

for elem in arr:
    if (elem in freq):
        freq[elem] += 1
    else:
        freq[elem] = 1

temp = freq[max(freq, key=lambda x: freq[x])]

if (n % 2 == 1):
    n += 1

if (temp > (n // 2) and n > 2):
    print("NO")
else:
    print("YES")