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=[0] * 1001
if n ==1:
    print("YES")

elif n==2:
    l,r=map(int,input().split())
    if (l==r):
         print("NO")
    else :
        print("YES")

else:
    l = list(map(int,input().split()))
    for c in l:
        a[c] += 1
        if (len(l) % 2 == 1 and a[c] > n // 2 + 1) or (len(l) % 2 == 0 and a[c] > n // 2):
            print("NO")
            exit()
    print("YES")
        
    

    
