#include<bits/stdc++.h>

using namespace std;

int n, a[505], sum;
bool subset[505][250005];

string moguceje() {
   for (int i = 0; i <= n; i++)
     subset[i][0] = true;

   for (int i = 1; i <= sum; i++)
     subset[0][i] = false;


   for (int i = 1; i <= n; i++){
     for (int j = 1; j <= sum; j++){
        if(j<a[i-1])
          subset[i][j] = subset[i-1][j];
        if (j >= a[i-1])
          subset[i][j] = (subset[i-1][j] || subset[i - 1][j-a[i-1]]);
      }
    }

    if (subset[n][sum])
       return "YES\n";
    else return "NO\n";
}

int main() {

   freopen("equation.in","r",stdin);
   freopen("equation.out","w",stdout);
   scanf("%d",&n);
   for (int i=0; i<n; i++)
     scanf("%d",&a[i]);

   for (int i=0; i<n; i++)
     sum+=a[i];
   if(sum%2==1)cout<<"NO"<<endl;
   else{
     sum/=2;
     cout << moguceje();
   }
   return 0;
}