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 yaro(n,arr):
    if n == 1:
        return "YES"
    if n == 2:
        if arr[0] != arr[1]:
            return "YES"
        else:
            return "NO"
    if n == 3:
        if arr[0] != arr[1] or arr[1] != arr[2] or arr[0] == arr[2]:
            return "YES"
        else:
            return "NO"
    l = [0]*1001
    limit = n//2
    for i in range(n):
        l[arr[i]] += 1
    for i in l:
        if i > limit:
            return "NO"
    return "YES"

n = int(input())
arr = map(int,input().split())
yaro(n,arr)
