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.
"""
    author - Sayan Bose
    date - 29.01.2020
    Brooklyn 99 is love!
"""

n = int(input())

li = list(map(int, input().split()))
f = 1
for i in li:
	if li.count(i) > (n//2)+1:
		f = 0
		break
print('YES') if f else print('NO')