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.
'''
Created on 05-May-2020

@author: Admin
'''
n=int(input())
l=[]
c=0;
d={}
l=input().split(' ')
for i in l:
    d[i]=1;
    c+=1

if c==1:
    print('YES')
else:
    if len(d)==1:
        print('NO')
    else:
        print('YES')
    