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.
# -*- coding: utf-8 -*-
"""
Created on Wed Apr 15 22:54:40 2020

@author: alexi
"""



#https://codeforces.com/problemset/problem/296/A --- Alexis Galvan


def yaroslav():
    
    length = int(input())
    array = list(map(int, input().split()))
    
    if len(array) == 1:
        return 'YES'
    
    dic = {}
    
    if len(array) % 2 == 0:
        for i in range(len(array)):
            if array[i] not in dic:
                dic[array[i]] = 1
            else:
                dic[array[i]] += 1
                if dic[array[i]] > (len(array)/2):
                    return 'NO'
    else:
        only_one = 0
        for i in range(len(array)):
            if array[i] not in dic:
                dic[array[i]] = 1
            else:
                dic[array[i]] += 1
                if dic[array[i]] == (int(len(array))/2)+2:
                    return 'NO'
    
    return 'YES'

A = yaroslav()
print(A)
                    
                    
                