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.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
    ll n,i,j,k,a,b;
    cin>>n;
    vector<ll>x(n);
    for(i=0;i<n;i++)    cin>>x[i];
    a=x[0];
    b=0;
    for(i=0;i<n;i++)
    {
        if(x[i]!=a)
            b++;
    }
    if(n==1)    b=1;
    if(b>0)
        cout<<"YES";
    else
        cout<<"NO";
}