#include <iostream>
#include <stdio.h>
#include <bitset>
using namespace std;

int n;
int nums[511];

bitset<250011> possible;

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

    int i,j;
    int goal = 0;

    scanf("%d",&n);

    for (i=1;i<=n;i++)
    {
        scanf("%d",&nums[i]);

        goal += nums[i];
    }

    if (goal % 2 == 1)
    {
        printf("NO\n");
        return 0;
    }
    goal /= 2;

    possible.reset();
    possible.set(0);

    for (i=1;i<=n;i++)
    {
        possible = possible | (possible<<nums[i]);
    }

    if (possible[goal])
    {
        printf("YES\n");
    }
    else
    {
        printf("NO\n");
    }

    return 0;
}