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())
l=[int(ele) for ele in input().split()]
d={}
for e in l:
    d[e]=d.get(e,0)+1
m=max(d.values())
if n%2==0:
    if m>n/2:print('NO')
    else:print('YES')
else:
    a=(n/2)+0.5
    if m>a:print('NO')
    else:print('YES')