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())
a = list(map(int, input().rstrip().split()))
d = dict()
for x in a:
    if x not in d:
        d[x] = 1
    else:
        d[x] += 1
maxm = 0
for x in d:
    if d[x] > maxm:
        maxm = d[x]
if n == 1:
    print("YES")
elif n == 2:
    if maxm == 1:
        print("YES")
    else:
        print("NO")
elif n == 3:
    if maxm <= 2:
        print("YES")
    else:
        print("NO")
elif n > 3:
    if maxm > n // 2:
        print("NO")
    else:
        print("YES")