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 obtain_array(n, array):
    for num in set(array):
        counter = array.count(num)
        if counter * 2 - 1 > n:
            return "NO"
    return "YES"

if __name__ == '__main__':
    n = int(input())
    nums = map(int, input().split())
    print(obtain_array(n, nums))
