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.
The first line contains integer *n* (1 ≤ *n* ≤ 100) — the number of elements in the array. The second line contains *n* integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 1000) — the array elements.
n = int(input())
arr = list(map(int, input().split()))

counts = dict()
mx = float('-inf')
if n == 1:
    print('YES')
else:
    for i in arr:
        if i in counts:
            counts[i] += 1
        else:
            counts[i] = 1

        mx = max(mx, counts[i])

    if len(counts) == 1:
        print('NO')
    else:
        if len(counts) >= mx:
            print('YES')
        else:
            c = 0
            good = False
            for i in counts.values():
                if i != mx:
                    c += i
                if c >= mx:
                    print('YES')
                    good = True
                    break

            if not good:
                print('NO')

