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())
ai=list(map(int,input().split()))
arr=[]
if n==len(ai):

    for i in ai:
        if i not in arr:
            arr.append(i)
    t=arr[0]
    for j in arr:

        if j==t and len(ai)!=1:
            a="NO"
            
        else:
            a="YES"

print(a)


