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())

k = list(map(int,input().split()))

k.sort()

hash = {}
hash1 ={
        'r': 0,
        'o': 0,
        }

for i in k:

    if i in hash.keys():
        hash[i] = hash[i]+1
    else:
        hash[i] = 1

max = 0
for i in hash.keys():

    if hash[i] > max:
        hash1['r'] = hash[i]
        max = hash[i]


    hash1['o']+=hash[i]
hash1['o'] = hash1['o'] - hash1['r']
# print(hash)
# print(hash1)


if hash1['o'] >=hash1['r'] - 1:

    print('YES')

else:
    print('NO')




