//https://qoj.ac/contest/1101/problem/5475
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PI acos(-1)
#define LSB(i) ((i) & -(i))
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define INF 1e15
#define MOD 1000000007
#define endl "\n"

#define all(data)       data.begin(),data.end()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()
#define MAXN 107
#define MAXR 10007
ll r[MAXN],dp[MAXN][2];
int main()
{
    ll n,mm=0;cin>>n;
    for(int i=1;i<=n;i++) {cin>>r[i]; mm+=r[i];}
    if(n&1 || mm&1) {cout<<"No"; return 0;}
    dp[0][0]=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=mm/2-r[i];j>=0;j--)
        {
            dp[j+r[i]][0]+=dp[j][1];
            dp[j+r[i]][1]+=dp[j][0];
        }
    }
    if(dp[mm/2][0]>=4)cout<<"Yes";
    else cout<<"No";
    return 0;
}