#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
using namespace std;

int t,n,m;
int lista[600];
int dp[600][130000];
int suma=0;

bool cmp(pair<int,int> x, pair<int,int> y)
{
    return (x.ff-x.ss)<(y.ff-y.ss);
}

int main () {

    freopen("equation.in","r",stdin);
    freopen("equation.out","w",stdout);

    scanf("%d",&n);

    for(int i=1;i<=n;i++){
        scanf("%d",&lista[i]);
        suma+=lista[i];
    }

    sort(lista+1,lista+n+1);
    if(suma&1){
        printf("NO");
        return 0;
    }
    int treba=suma/2;
    dp[0][0]=1;
    for(int i=1;i<=n;i++){
        for(int j=0;j<=treba;j++){
            if(j-lista[i]>=0){
                dp[i][j]=max(dp[i-1][j],dp[i-1][j-lista[i]]);
            }
            dp[i][j]=max(dp[i-1][j],dp[i][j]);
        }
    }
    for(int i=0;i<=n;i++){
        if(dp[i][treba]){
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
    return 0;
}