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.
import math
def yaro(n,arr):
    if n == 1:
        return "YES"
    if n == 2:
        if arr[0] != arr[1]:
            return "YES"
        else:
            return "NO"
    if n == 3:
        if arr[0] != arr[1] or arr[1] != arr[2] or arr[0] == arr[2]:
            return "YES"
        else:
            return "NO"
    l = [0]*1001
    limit = math.ceil(n/2)
    for i in range(n):
        l[arr[i]] += 1
    for i in l:
        if i > limit:
            return "NO"
    return "YES"

n = int(input())
arr = list(map(int,input().split()))
print(yaro(n,arr))