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.
'''
Time Started :
Tue Feb  4 12:31:14 PST 2014
Time Ended :

'''
import math
def can_get_array(nums):
    counts = [0] * 1000
    max_count = -1
    for num in nums:
        counts[num - 1] += 1
        if max_count < counts[num - 1]:
            max_count = counts[num - 1]

    max_len = int(math.ceil(len(nums) / float(2)))
    if max_count > max_len:
        return 'NO'
    return 'YES'

nums = map(int, raw_input('').split())
nums = map(int, raw_input('').split())
print can_get_array(nums)


    


    
