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.
#coding: utf-8

def mais(lista,size):
    
    maior = 0
    
    for i in range(size):
        
        contador = 0    
            
        for j in range(size):
            
            if lista[i] == lista[j]:
                contador += 1
    
        if contador > maior :
            maior = contador
    
    return maior    
    
    
tamanho = int(raw_input())
elementos = []
elementos = raw_input().split()

repetido = mais(elementos,tamanho)

if tamanho  % 2 != 0 :
    tamanho += 1

if tamanho / 2 < repetido :
    print"NO"

else:
    print"YES"



