#include<iostream>
#include<algorithm>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n)   REP(i,0,n)
int cnt = 0;

bool solve(int n,int now,int *inp,int *vol){
  cnt++;
  if ( now== n){
    rep(i,n){
      if ( vol[i]==0 || vol[i] == inp[i])continue;
      else return false;
    }
    return true;
  }

  if ( cnt == 1000000)return true;
  
  rep(i,now){
    if ( vol[i]-inp[now] <0)continue;
    vol[i]-=inp[now];
    vol[now]=inp[now];
    if ( solve(n,now+1,inp,vol))return true;
    vol[now]=0;
    vol[i]+=inp[now];
  }
  
  
  return false;
}

main(){
  int n;
  while(cin>>n && n){
    int in[n];
    int vol[n];
    rep(i,n)cin>>in[i],vol[i]=0;
    sort(in,in+n,greater<int>());
    vol[0]=in[0];
    if ( solve(n,1,in,vol) == true)puts("YES");
    else puts("NO");
				     
  }
  return false;
}