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())
s = list(map(int, input().split()))
z = list()
if n == 1:
    print('YES')
    exit()
if n == 2:
    if s[0] == s[1]:
        print('NO')
        exit()
    else:
        print('YES')
        exit()
z.append(s.count(s[0]))
for i in range(n-1):
    if s[i] == s[i+1]:
        continue
    z.append(s.count(s[i]))
if len(z) == 1:
    print('NO')
    exit()
if max(z) <= sum(z) - max(z):
    print('YES')
else:
    print('NO')
