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.
# Codeforces - Yaroslav and Permutations
# https://codeforces.com/contest/296/problem/A
#
# Author: eloyhz
# Date: Sep/04/2020
#


if __name__ == '__main__':
    n = int(input())
    a = [int(x) for x in input().split()]
    c = [0] * 1001
    for x in a:
        c[x] += 1
    if max(c) <= (n + 1) / 2:
        print('YES')
    else:
        print('NO')
#    if n > 1 and max(c) > round(n / 2):
 #       print('NO')
  #  else:
   #     print('YES')

