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 r(m):
    h=0
    i=0
    while i<f:
        if i+2<len(m) and m[i]==m[i+1]:
            m[i+2],m[i+1]=m[i+1],m[i+2]
            h=-1
            i+=3
        else:
            i+=1
    if h!=0:
        return False
    else:
        return True
f=int(input(""))
m=list(map(int,input("").split(" ")))
w=0
i=0
if len(m)>2 and len(list(set(m)))>1:
    while i<f:
        if i+2<f and m[i]==m[i+1]:
            m[i+2],m[i+1]=m[i+1],m[i+2]
            i+=3
        else:
            i+=1
elif len(m)==1:
    print("YES")
    w=9
else:
    print("NO")
    w=9
if w!=9:
    if r(m):
        print("YES")
    else:
        print("NO")