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.
import statictics
arr_size = int(input())
arr = list(map(int, input().split()))
res = statictics.mode(arr)
freq = 0
for x in arr:
    if x == res:
        freq += 1
if arr_size % 2 == 0:
    max_allowed_num = int(arr_size / 2)
else:
    max_allowed_num = int(arr_size / 2) + 1
if freq <= max_allowed_num:
    print('YES')
else:
    print('NO')