#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define MAX_V 10000
#define INF 10000000
#define M 1000000
typedef pair<int,int> P;

struct edge { int to,cap,cost,rev; };

int V,edgecnt;
vector<edge> G[MAX_V];
int h[MAX_V];
int dist[MAX_V];
int prevv[MAX_V],preve[MAX_V];

void init_edge(){
  for(int i=0;i<V;i++)G[i].clear();
  edgecnt=0;
}
void add_edge(int from,int to,int cap,int cost){
  G[from].push_back((edge){to,cap,cost,G[to].size()});
  G[to].push_back((edge){from,0,-cost,G[from].size()-1});
}

void add_edge2(int from,int to,int cap,int cost){
  edgecnt++;
  add_edge(from,to,0,cost);
  add_edge(from,to,cap,cost-M);

}


int min_cost_flow(int s,int t,int f){
  int res = 0;
  fill(h,h+V,0);
  while(f>0){

    priority_queue< P, vector<P>, greater<P> >  que;
    fill( dist, dist+V , INF );
    dist[s]=0;
    que.push(P(0,s));
    while(!que.empty()){
      P p = que.top(); que.pop();
      int v = p.second;
      if(dist[v]<p.first)continue;
      for(int i=0;i<(int)G[v].size();i++){
	edge &e = G[v][i];
	if(e.cap>0&&dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){
	  dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];
	  prevv[e.to]=v;
	  preve[e.to]=i;
	  que.push(P(dist[e.to],e.to));
	}
      }
    }

    if(dist[t]==INF){
      return -1;
    }
    for(int v=0;v<V;v++)h[v]+=dist[v];

    int d=f;
    for(int v=t;v!=s;v=prevv[v]){
      d=min(d,G[prevv[v]][preve[v]].cap);
    }
    f-=d;
    res+=d*h[t];
    for(int v=t;v!=s;v=prevv[v]){
      edge &e = G[prevv[v]][preve[v]];
      e.cap -= d;
      G[v][e.rev].cap += d;
    }
  }
  return res;
}

int n,sum;
int t[100];
int main(){
  
  while(cin>>n){

    init_edge();
    sum=0;
    for(int i=0;i<n;i++){cin>>t[i];sum-=t[i];}

    sort(t,t+n);
    reverse(t,t+n);
    
    for(int i=0;i<n;i++){
      add_edge(i,n+i,t[i],-1);
    }

    for(int i=0;i<n-1;i++){
      for(int j=i+1;j<n;j++){
	add_edge(n+i,j,t[j],0);
      }
    }
    
    for(int i=0;i<n;i++){
      add_edge(n+i,n+n,INF,0);
    }

    add_edge(n+n+1,0,INF,0);
    V=n+n+2;
    //cout<<min_cost_flow(0,n+n,t[0])<<' '<<sum<<endl;
    int z=min_cost_flow(n+n+1,n+n,t[0]);
    if(z==-1||z+edgecnt*M!=sum)cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
    
  }

  return 0;
}