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.

Input

The first line contains integer n (1 ≤ n ≤ 100) — the number of elements in the array. The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the array elements.

Output

In the single line print "YES" (without the quotes) if Yaroslav can obtain the array he needs, and "NO" (without the quotes) otherwise.

Examples

Input

1
1


Output

YES


Input

3
1 1 2


Output

YES


Input

4
7 7 7 7


Output

NO

Note

In the first sample the initial array fits well.

In the second sample Yaroslav can get array: 1, 2, 1. He can swap the last and the second last elements to obtain it.

In the third sample Yarosav can't get the array he needs.
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(flag>0):
            print("NO")
        elif(flag==0):
            print("YES") 
    else:
        print("YES")
    
elif(n==1):
    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")
