#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <utility>
#include <iterator>
#include <algorithm>
#define ll long long
#define pb push_back
#define cl clear
#define sz size
using namespace std;

int bs(int *st,int *en,int val,char c)
{
    int k;
    //first element not less than val,else returns last
    if(c=='l') k=lower_bound(st,en,val)-st;
    //first element greater than val,else returns last
    if(c=='u') k=upper_bound(st,en,val)-st;
    return k;
}

int prime[78500];
int sieve()
{
    int a,b,c;
    c=0; prime[c]=2;
    bool *m=(bool *)calloc(1000006,sizeof(bool));
    for(a=3;a<=1000000;a=a+2)
    {
        if(!m[a])
        {
            prime[++c]=a;
            for(b=2*a;b<=1000000;b=b+a) m[b]=true;
        }
    }
    free(m);
    return c;
}

int ar[1005];

int main()
{
    //freopen("0.in","r",stdin);
    //freopen("0.out","w",stdout);

    int a,b,c,d,e,y,z,n;

    double x,xx;

    while(scanf("%d",&n)==1)
    {
        x=0;
        for(a=1;a<=n;a++)
        {
            scanf("%d",&ar[a]);
            x=x+ar[a]*1.00;
        }
        x=x/(n*1.00);
        sort(ar+1,ar+n+1);
        e=(n+1)/2;
        xx=ar[e]*1.00;
        if(x>=xx) printf("NO\n");
        else printf("YES\n");
    }

    return 0;
}