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.
def arr_inp():
    return [int(x) for x in input().split()]


import math as m

n = int(input())
a = arr_inp()
dic = {}
for i in range(n):
    if (str(a[i]) not in dic):
        dic[str(a[i])] = 1
    else:
        dic[str(a[i])] += 1

if (max(dic.values())> m.ceil(n / 2)):
    exit(print('NO'))
print('YES')
