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.
#80
n=int(input())
l=list(map(int,input().split()))
s=0
c=0
t=0
for a in range(len(l)-1):
    for b in range(a+1,len(l)):
        if l[a]!=l[b]:
            s=l[a+1]
            l[a+1]=l[b]
            l[b]=s
            c=1
            break
    if c==0:
        print('No')
        t=1
        break
    else:
        c=0

if t==0:
    print('YES')

            
