#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#define rt return
#define bk break
#define ct continue
#define sf scanf
#define pf printf
#define ms memset
#define si(n) sf("%d",&n)
#define pi(n) pf("%d\n",n)
#define REP0(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,s,n) for(int i=s;i<=(n);i++)
#define db double
#define op operator
#define pb push_back
#define LL long long
#define INF 0x3fffffff
#define eps 1e-8
#define PI acos(-1)
#define maxn 1010
using namespace std;
bool judge(int a[],int n){
int cnt=1,x=a[0],i=1;
while(i<n){
if(a[i]==x)
cnt++;
else if(cnt>0)
cnt--;
else
x=a[i];
i++;
}
cnt=0;
while(i){
if(a[--i]==x)
cnt++;
}
return (cnt>n/2)?true:false;
}
int main(){
#ifdef ACBang
freopen("in.txt","r",stdin);
#endif
int n;
int a[maxn];
while(~sf("%d",&n)){
REP0(i,n)si(a[i]);
if(judge(a,n))puts("YES");
else puts("NO");
}
rt 0;
}
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#define rt return
#define bk break
#define ct continue
#define sf scanf
#define pf printf
#define ms memset
#define si(n) sf("%d",&n)
#define pi(n) pf("%d\n",n)
#define REP0(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,s,n) for(int i=s;i<=(n);i++)
#define db double
#define op operator
#define pb push_back
#define LL long long
#define INF 0x3fffffff
#define eps 1e-8
#define PI acos(-1)
#define maxn 1010
using namespace std;
bool judge(int a[],int n){
int cnt=1,x=a[0],i=1;
while(i<n){
if(a[i]==x)
cnt++;
else if(cnt>0)
cnt--;
else
x=a[i];
i++;
}
cnt=0;
while(i){
if(a[--i]==x)
cnt++;
}
return (cnt>n/2)?true:false;
}
int main(){
#ifdef ACBang
freopen("in.txt","r",stdin);
#endif
int n;
int a[maxn];
while(~sf("%d",&n)){
REP0(i,n)si(a[i]);
if(judge(a,n))puts("YES");
else puts("NO");
}
rt 0;
}