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 = list(map(int, input().split()))

rep = 0

memorize = []

def get_ocurrences(no):
    ocurr = 0
    for i in arr:
        if no == i:
            ocurr+=1
    if ocurr == 1:
        return 0
    else:
        return ocurr

for i in range (0,n):
    if arr[i] not in memorize:
        rep+= get_ocurrences(arr[i])
    memorize.append(arr[i])

if rep <= n or n ==1 or (n==3 and rep ==2):
    print("YES")
else:
    print("NO")