#include<iostream>
#include<cstdio>
#include<algorithm>
#define endl '\n'
using namespace std;
typedef long long ll;
int i,j,p,q,n,m,k,a[506],b[300001];
int main()
{
    freopen("equation.in", "r", stdin);
    freopen("equation.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>a[i];
        p+=a[i];
    }
    b[0] = 1;
    sort(a+1,a+n+1);
    if(p%2!=0)
    {
        cout<<"NO"<<endl;
        return 0;
    }
    for(i=1;i<=n;i++)
    {
        for(j=p;j>=1;j--)
        {
            if(j-a[i]>=0 && b[j-a[i]])
            {
                b[j] = 1;
                if(j==p/2)
                {
                    cout<<"YES"<<endl;
                    return 0;
                }
            }
        }
    }
    cout<<"NO"<<endl;
    return 0;
}