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())
l=[int(i) for i in input().split()]
c=set(l)
d=0
e=1
flag=0
for i in c:
    if(l.count(i)>d):
        d=l.count(i)
if(n==2):
    if(d>1):
        flag=1
if(n==1):
    flag=0
if(flag>0):
    print("No")
elif(flag==0):
    print("Yes")  
    
        
else:        
    for i in range(3,len(l)+1):
        if(i%2!=0):
            e=e+1       
    if(d>e):
        print('No')
    else:
        print("Yes")
